./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/ldv-regression/test23_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b2c579f4-c1d0-4c73-aed5-d708cd01dd5d/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b2c579f4-c1d0-4c73-aed5-d708cd01dd5d/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b2c579f4-c1d0-4c73-aed5-d708cd01dd5d/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b2c579f4-c1d0-4c73-aed5-d708cd01dd5d/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-regression/test23_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_b2c579f4-c1d0-4c73-aed5-d708cd01dd5d/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b2c579f4-c1d0-4c73-aed5-d708cd01dd5d/bin-2019/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 308e43cca528a064aecd41d099b341627e43bb71 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_b2c579f4-c1d0-4c73-aed5-d708cd01dd5d/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b2c579f4-c1d0-4c73-aed5-d708cd01dd5d/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b2c579f4-c1d0-4c73-aed5-d708cd01dd5d/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b2c579f4-c1d0-4c73-aed5-d708cd01dd5d/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-regression/test23_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_b2c579f4-c1d0-4c73-aed5-d708cd01dd5d/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b2c579f4-c1d0-4c73-aed5-d708cd01dd5d/bin-2019/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 308e43cca528a064aecd41d099b341627e43bb71 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 10:35:39,489 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 10:35:39,490 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 10:35:39,496 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 10:35:39,496 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 10:35:39,497 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 10:35:39,498 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 10:35:39,499 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 10:35:39,500 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 10:35:39,500 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 10:35:39,501 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 10:35:39,501 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 10:35:39,502 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 10:35:39,502 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 10:35:39,503 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 10:35:39,504 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 10:35:39,504 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 10:35:39,505 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 10:35:39,507 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 10:35:39,508 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 10:35:39,508 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 10:35:39,509 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 10:35:39,511 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 10:35:39,511 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 10:35:39,511 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 10:35:39,512 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 10:35:39,512 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 10:35:39,513 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 10:35:39,513 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 10:35:39,514 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 10:35:39,514 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 10:35:39,515 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 10:35:39,515 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 10:35:39,515 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 10:35:39,516 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 10:35:39,516 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 10:35:39,516 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b2c579f4-c1d0-4c73-aed5-d708cd01dd5d/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-10 10:35:39,526 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 10:35:39,526 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 10:35:39,527 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 10:35:39,527 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 10:35:39,527 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 10:35:39,527 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 10:35:39,527 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 10:35:39,528 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 10:35:39,528 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 10:35:39,528 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 10:35:39,528 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 10:35:39,528 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 10:35:39,528 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 10:35:39,528 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 10:35:39,528 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 10:35:39,529 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 10:35:39,529 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 10:35:39,529 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 10:35:39,529 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 10:35:39,529 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 10:35:39,529 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 10:35:39,529 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 10:35:39,530 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 10:35:39,530 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 10:35:39,530 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 10:35:39,530 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 10:35:39,530 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 10:35:39,530 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 10:35:39,530 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 10:35:39,530 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_b2c579f4-c1d0-4c73-aed5-d708cd01dd5d/bin-2019/uautomizer 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 308e43cca528a064aecd41d099b341627e43bb71 [2018-11-10 10:35:39,551 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 10:35:39,559 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 10:35:39,561 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 10:35:39,562 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 10:35:39,562 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 10:35:39,562 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b2c579f4-c1d0-4c73-aed5-d708cd01dd5d/bin-2019/uautomizer/../../sv-benchmarks/c/ldv-regression/test23_true-unreach-call.c [2018-11-10 10:35:39,596 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b2c579f4-c1d0-4c73-aed5-d708cd01dd5d/bin-2019/uautomizer/data/30ff98c87/08827326d29e485fbcc13a324344228c/FLAG4bb761df4 [2018-11-10 10:35:39,988 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 10:35:39,988 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b2c579f4-c1d0-4c73-aed5-d708cd01dd5d/sv-benchmarks/c/ldv-regression/test23_true-unreach-call.c [2018-11-10 10:35:39,992 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b2c579f4-c1d0-4c73-aed5-d708cd01dd5d/bin-2019/uautomizer/data/30ff98c87/08827326d29e485fbcc13a324344228c/FLAG4bb761df4 [2018-11-10 10:35:40,002 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b2c579f4-c1d0-4c73-aed5-d708cd01dd5d/bin-2019/uautomizer/data/30ff98c87/08827326d29e485fbcc13a324344228c [2018-11-10 10:35:40,004 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 10:35:40,005 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 10:35:40,006 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 10:35:40,006 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 10:35:40,008 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 10:35:40,008 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:35:40" (1/1) ... [2018-11-10 10:35:40,010 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f3e6fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:35:40, skipping insertion in model container [2018-11-10 10:35:40,010 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:35:40" (1/1) ... [2018-11-10 10:35:40,016 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 10:35:40,028 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 10:35:40,132 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:35:40,142 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 10:35:40,155 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:35:40,168 INFO L193 MainTranslator]: Completed translation [2018-11-10 10:35:40,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:35:40 WrapperNode [2018-11-10 10:35:40,169 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 10:35:40,169 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 10:35:40,169 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 10:35:40,169 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 10:35:40,177 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:35:40" (1/1) ... [2018-11-10 10:35:40,177 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:35:40" (1/1) ... [2018-11-10 10:35:40,183 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:35:40" (1/1) ... [2018-11-10 10:35:40,183 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:35:40" (1/1) ... [2018-11-10 10:35:40,191 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:35:40" (1/1) ... [2018-11-10 10:35:40,195 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:35:40" (1/1) ... [2018-11-10 10:35:40,196 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:35:40" (1/1) ... [2018-11-10 10:35:40,198 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 10:35:40,198 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 10:35:40,198 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 10:35:40,198 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 10:35:40,199 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:35:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b2c579f4-c1d0-4c73-aed5-d708cd01dd5d/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 10:35:40,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 10:35:40,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 10:35:40,279 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2018-11-10 10:35:40,279 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dummy [2018-11-10 10:35:40,279 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2018-11-10 10:35:40,280 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 10:35:40,280 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 10:35:40,280 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-10 10:35:40,280 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2018-11-10 10:35:40,280 INFO L130 BoogieDeclarations]: Found specification of procedure init [2018-11-10 10:35:40,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 10:35:40,280 INFO L130 BoogieDeclarations]: Found specification of procedure get_dummy [2018-11-10 10:35:40,280 INFO L130 BoogieDeclarations]: Found specification of procedure check [2018-11-10 10:35:40,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 10:35:40,281 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 10:35:40,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 10:35:40,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-10 10:35:40,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-10 10:35:40,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 10:35:40,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-10 10:35:40,511 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 10:35:40,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:35:40 BoogieIcfgContainer [2018-11-10 10:35:40,512 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 10:35:40,513 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 10:35:40,513 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 10:35:40,515 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 10:35:40,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 10:35:40" (1/3) ... [2018-11-10 10:35:40,517 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b44b6b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:35:40, skipping insertion in model container [2018-11-10 10:35:40,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:35:40" (2/3) ... [2018-11-10 10:35:40,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b44b6b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:35:40, skipping insertion in model container [2018-11-10 10:35:40,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:35:40" (3/3) ... [2018-11-10 10:35:40,520 INFO L112 eAbstractionObserver]: Analyzing ICFG test23_true-unreach-call.c [2018-11-10 10:35:40,529 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 10:35:40,535 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 10:35:40,546 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 10:35:40,565 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 10:35:40,565 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 10:35:40,565 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 10:35:40,566 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 10:35:40,566 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 10:35:40,566 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 10:35:40,566 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 10:35:40,566 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 10:35:40,566 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 10:35:40,579 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states. [2018-11-10 10:35:40,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-10 10:35:40,584 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:35:40,584 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:35:40,586 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:35:40,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:35:40,589 INFO L82 PathProgramCache]: Analyzing trace with hash 211714867, now seen corresponding path program 1 times [2018-11-10 10:35:40,590 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:35:40,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:35:40,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:35:40,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:35:40,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:35:40,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:35:40,769 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 10:35:40,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:35:40,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 10:35:40,774 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 10:35:40,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 10:35:40,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 10:35:40,784 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 2 states. [2018-11-10 10:35:40,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:35:40,802 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2018-11-10 10:35:40,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 10:35:40,803 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 82 [2018-11-10 10:35:40,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:35:40,809 INFO L225 Difference]: With dead ends: 101 [2018-11-10 10:35:40,809 INFO L226 Difference]: Without dead ends: 81 [2018-11-10 10:35:40,811 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 10:35:40,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-10 10:35:40,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-11-10 10:35:40,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-10 10:35:40,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 83 transitions. [2018-11-10 10:35:40,840 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 83 transitions. Word has length 82 [2018-11-10 10:35:40,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:35:40,842 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 83 transitions. [2018-11-10 10:35:40,842 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 10:35:40,842 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2018-11-10 10:35:40,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-10 10:35:40,844 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:35:40,845 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:35:40,845 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:35:40,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:35:40,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1243526489, now seen corresponding path program 1 times [2018-11-10 10:35:40,845 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:35:40,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:35:40,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:35:40,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:35:40,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:35:40,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:35:41,524 WARN L179 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 358 DAG size of output: 10 [2018-11-10 10:35:41,705 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 23 [2018-11-10 10:35:42,021 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 10:35:42,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:35:42,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-11-10 10:35:42,023 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-10 10:35:42,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 10:35:42,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2018-11-10 10:35:42,023 INFO L87 Difference]: Start difference. First operand 81 states and 83 transitions. Second operand 15 states. [2018-11-10 10:35:42,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:35:42,483 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2018-11-10 10:35:42,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 10:35:42,484 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 84 [2018-11-10 10:35:42,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:35:42,486 INFO L225 Difference]: With dead ends: 115 [2018-11-10 10:35:42,486 INFO L226 Difference]: Without dead ends: 105 [2018-11-10 10:35:42,487 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2018-11-10 10:35:42,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-10 10:35:42,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 95. [2018-11-10 10:35:42,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-10 10:35:42,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 100 transitions. [2018-11-10 10:35:42,494 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 100 transitions. Word has length 84 [2018-11-10 10:35:42,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:35:42,494 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 100 transitions. [2018-11-10 10:35:42,494 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-10 10:35:42,495 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 100 transitions. [2018-11-10 10:35:42,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-10 10:35:42,496 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:35:42,496 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:35:42,496 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:35:42,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:35:42,497 INFO L82 PathProgramCache]: Analyzing trace with hash 734053399, now seen corresponding path program 1 times [2018-11-10 10:35:42,497 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:35:42,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:35:42,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:35:42,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:35:42,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:35:42,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:35:42,600 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 10:35:42,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:35:42,601 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b2c579f4-c1d0-4c73-aed5-d708cd01dd5d/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:35:42,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:35:42,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:35:42,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:35:42,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 10:35:42,679 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:35:42,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:42,681 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-10 10:35:42,692 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:35:42,693 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:35:42,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-10 10:35:42,694 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:35:42,697 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:42,697 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-11-10 10:35:42,728 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:35:42,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:35:42,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 14 [2018-11-10 10:35:42,745 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 10:35:42,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 10:35:42,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-11-10 10:35:42,745 INFO L87 Difference]: Start difference. First operand 95 states and 100 transitions. Second operand 14 states. [2018-11-10 10:35:43,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:35:43,044 INFO L93 Difference]: Finished difference Result 122 states and 128 transitions. [2018-11-10 10:35:43,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 10:35:43,044 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 84 [2018-11-10 10:35:43,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:35:43,045 INFO L225 Difference]: With dead ends: 122 [2018-11-10 10:35:43,045 INFO L226 Difference]: Without dead ends: 103 [2018-11-10 10:35:43,046 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2018-11-10 10:35:43,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-10 10:35:43,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 95. [2018-11-10 10:35:43,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-10 10:35:43,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2018-11-10 10:35:43,052 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 84 [2018-11-10 10:35:43,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:35:43,052 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2018-11-10 10:35:43,052 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 10:35:43,052 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2018-11-10 10:35:43,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-10 10:35:43,053 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:35:43,053 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:35:43,054 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:35:43,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:35:43,054 INFO L82 PathProgramCache]: Analyzing trace with hash 952908117, now seen corresponding path program 1 times [2018-11-10 10:35:43,054 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:35:43,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:35:43,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:35:43,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:35:43,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:35:43,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:35:43,542 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 380 DAG size of output: 9 [2018-11-10 10:35:43,756 WARN L179 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 385 DAG size of output: 10 [2018-11-10 10:35:43,908 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 385 DAG size of output: 10 [2018-11-10 10:35:44,254 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 10:35:44,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:35:44,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-11-10 10:35:44,255 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-10 10:35:44,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-10 10:35:44,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-11-10 10:35:44,256 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 17 states. [2018-11-10 10:35:44,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:35:44,674 INFO L93 Difference]: Finished difference Result 116 states and 121 transitions. [2018-11-10 10:35:44,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 10:35:44,674 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 84 [2018-11-10 10:35:44,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:35:44,675 INFO L225 Difference]: With dead ends: 116 [2018-11-10 10:35:44,675 INFO L226 Difference]: Without dead ends: 106 [2018-11-10 10:35:44,675 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=140, Invalid=616, Unknown=0, NotChecked=0, Total=756 [2018-11-10 10:35:44,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-10 10:35:44,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 89. [2018-11-10 10:35:44,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-10 10:35:44,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2018-11-10 10:35:44,681 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 84 [2018-11-10 10:35:44,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:35:44,681 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2018-11-10 10:35:44,681 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-10 10:35:44,681 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2018-11-10 10:35:44,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-10 10:35:44,682 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:35:44,683 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:35:44,683 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:35:44,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:35:44,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1140082873, now seen corresponding path program 1 times [2018-11-10 10:35:44,683 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:35:44,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:35:44,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:35:44,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:35:44,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:35:44,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:35:45,120 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 30 [2018-11-10 10:35:45,267 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 31 [2018-11-10 10:35:45,495 WARN L179 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 48 [2018-11-10 10:35:45,870 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 10:35:45,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:35:45,870 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b2c579f4-c1d0-4c73-aed5-d708cd01dd5d/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:35:45,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:35:45,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:35:45,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:35:46,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-10 10:35:46,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-11-10 10:35:46,061 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:35:46,062 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:46,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:46,066 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-10 10:35:46,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2018-11-10 10:35:46,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 9 [2018-11-10 10:35:46,243 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:35:46,245 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:46,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:46,248 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:5 [2018-11-10 10:35:46,274 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 10:35:46,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:35:46,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 15] total 37 [2018-11-10 10:35:46,290 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-10 10:35:46,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-10 10:35:46,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1231, Unknown=0, NotChecked=0, Total=1332 [2018-11-10 10:35:46,291 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 37 states. [2018-11-10 10:35:48,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:35:48,013 INFO L93 Difference]: Finished difference Result 124 states and 130 transitions. [2018-11-10 10:35:48,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-10 10:35:48,013 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 87 [2018-11-10 10:35:48,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:35:48,014 INFO L225 Difference]: With dead ends: 124 [2018-11-10 10:35:48,014 INFO L226 Difference]: Without dead ends: 114 [2018-11-10 10:35:48,015 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 105 SyntacticMatches, 4 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 667 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=395, Invalid=3145, Unknown=0, NotChecked=0, Total=3540 [2018-11-10 10:35:48,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-10 10:35:48,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 101. [2018-11-10 10:35:48,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-10 10:35:48,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 105 transitions. [2018-11-10 10:35:48,026 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 105 transitions. Word has length 87 [2018-11-10 10:35:48,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:35:48,026 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 105 transitions. [2018-11-10 10:35:48,026 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-10 10:35:48,026 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2018-11-10 10:35:48,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-10 10:35:48,027 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:35:48,027 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:35:48,028 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:35:48,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:35:48,030 INFO L82 PathProgramCache]: Analyzing trace with hash -297934389, now seen corresponding path program 1 times [2018-11-10 10:35:48,030 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:35:48,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:35:48,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:35:48,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:35:48,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:35:48,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:35:48,427 WARN L179 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 46 [2018-11-10 10:35:49,191 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 10:35:49,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:35:49,191 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b2c579f4-c1d0-4c73-aed5-d708cd01dd5d/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:35:49,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:35:49,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:35:49,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:35:49,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-10 10:35:49,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-11-10 10:35:49,279 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:35:49,280 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:49,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:49,284 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-10 10:35:49,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2018-11-10 10:35:49,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 9 [2018-11-10 10:35:49,403 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:35:49,410 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:49,412 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:49,413 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:5 [2018-11-10 10:35:49,435 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 10:35:49,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:35:49,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 15] total 30 [2018-11-10 10:35:49,452 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-10 10:35:49,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-10 10:35:49,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=798, Unknown=0, NotChecked=0, Total=870 [2018-11-10 10:35:49,452 INFO L87 Difference]: Start difference. First operand 101 states and 105 transitions. Second operand 30 states. [2018-11-10 10:35:50,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:35:50,454 INFO L93 Difference]: Finished difference Result 125 states and 130 transitions. [2018-11-10 10:35:50,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-10 10:35:50,455 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 87 [2018-11-10 10:35:50,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:35:50,455 INFO L225 Difference]: With dead ends: 125 [2018-11-10 10:35:50,456 INFO L226 Difference]: Without dead ends: 115 [2018-11-10 10:35:50,456 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 79 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=246, Invalid=1734, Unknown=0, NotChecked=0, Total=1980 [2018-11-10 10:35:50,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-11-10 10:35:50,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 101. [2018-11-10 10:35:50,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-10 10:35:50,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 105 transitions. [2018-11-10 10:35:50,465 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 105 transitions. Word has length 87 [2018-11-10 10:35:50,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:35:50,465 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 105 transitions. [2018-11-10 10:35:50,465 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-10 10:35:50,465 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2018-11-10 10:35:50,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-10 10:35:50,466 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:35:50,466 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:35:50,466 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:35:50,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:35:50,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1010770539, now seen corresponding path program 2 times [2018-11-10 10:35:50,466 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:35:50,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:35:50,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:35:50,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:35:50,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:35:50,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:35:50,589 ERROR L253 erpolLogProxyWrapper]: Symbol error in Interpolant 54. Subtree only symbols: [(|~#d1~0.offset_2| Int)]. Non-subtree only symbols: []. [2018-11-10 10:35:50,591 ERROR L253 erpolLogProxyWrapper]: Symbol error in Interpolant 59. Subtree only symbols: [(|~#d1~0.offset_2| Int)]. Non-subtree only symbols: []. [2018-11-10 10:35:50,593 ERROR L253 erpolLogProxyWrapper]: Symbol error in Interpolant 60. Subtree only symbols: [(|~#d1~0.offset_2| Int)]. Non-subtree only symbols: []. [2018-11-10 10:35:50,596 ERROR L253 erpolLogProxyWrapper]: Symbol error in Interpolant 65. Subtree only symbols: [(|~#d1~0.offset_2| Int)]. Non-subtree only symbols: []. [2018-11-10 10:35:50,600 ERROR L253 erpolLogProxyWrapper]: Symbol error in Interpolant 66. Subtree only symbols: [(|~#d1~0.offset_2| Int)]. Non-subtree only symbols: []. [2018-11-10 10:35:50,604 ERROR L253 erpolLogProxyWrapper]: Symbol error in Interpolant 67. Subtree only symbols: [(|~#d1~0.offset_2| Int)]. Non-subtree only symbols: []. [2018-11-10 10:35:50,611 ERROR L253 erpolLogProxyWrapper]: Symbol error in Interpolant 68. Subtree only symbols: [(|~#d1~0.offset_2| Int)]. Non-subtree only symbols: []. [2018-11-10 10:35:50,618 ERROR L253 erpolLogProxyWrapper]: Symbol error in Interpolant 69. Subtree only symbols: [(|~#d1~0.offset_2| Int)]. Non-subtree only symbols: []. [2018-11-10 10:35:50,623 ERROR L253 erpolLogProxyWrapper]: Symbol error in Interpolant 70. Subtree only symbols: [(|~#d1~0.offset_2| Int), (main_~i~0_66 Int)]. Non-subtree only symbols: []. [2018-11-10 10:35:50,624 ERROR L253 erpolLogProxyWrapper]: Symbol error in Interpolant 71. Subtree only symbols: [(|~#d1~0.offset_2| Int), (main_~i~0_66 Int)]. Non-subtree only symbols: []. [2018-11-10 10:35:50,626 ERROR L253 erpolLogProxyWrapper]: Symbol error in Interpolant 72. Subtree only symbols: [(|~#d1~0.offset_2| Int), (main_~i~0_66 Int)]. Non-subtree only symbols: []. [2018-11-10 10:35:50,627 ERROR L253 erpolLogProxyWrapper]: Symbol error in Interpolant 73. Subtree only symbols: [(|~#d1~0.offset_2| Int), (main_~i~0_66 Int)]. Non-subtree only symbols: []. [2018-11-10 10:35:50,629 ERROR L253 erpolLogProxyWrapper]: Symbol error in Interpolant 74. Subtree only symbols: [(|~#d1~0.offset_2| Int), (main_~i~0_66 Int)]. Non-subtree only symbols: []. [2018-11-10 10:35:50,630 ERROR L253 erpolLogProxyWrapper]: Symbol error in Interpolant 75. Subtree only symbols: [(|~#d1~0.offset_2| Int), (main_~i~0_66 Int)]. Non-subtree only symbols: []. [2018-11-10 10:35:50,632 ERROR L253 erpolLogProxyWrapper]: Symbol error in Interpolant 76. Subtree only symbols: [(|~#d1~0.offset_2| Int), (main_~i~0_66 Int)]. Non-subtree only symbols: []. [2018-11-10 10:35:50,635 ERROR L253 erpolLogProxyWrapper]: Symbol error in Interpolant 77. Subtree only symbols: [(|~#d1~0.offset_2| Int), (main_~i~0_66 Int)]. Non-subtree only symbols: []. [2018-11-10 10:35:50,636 ERROR L253 erpolLogProxyWrapper]: Symbol error in Interpolant 78. Subtree only symbols: [(|~#d1~0.offset_2| Int), (main_~i~0_66 Int)]. Non-subtree only symbols: []. [2018-11-10 10:35:50,637 ERROR L253 erpolLogProxyWrapper]: Symbol error in Interpolant 79. Subtree only symbols: [(|~#d1~0.offset_2| Int), (main_~i~0_66 Int)]. Non-subtree only symbols: []. [2018-11-10 10:35:50,637 ERROR L253 erpolLogProxyWrapper]: Symbol error in Interpolant 80. Subtree only symbols: [(|~#d1~0.offset_2| Int), (main_~i~0_66 Int)]. Non-subtree only symbols: []. [2018-11-10 10:35:50,641 ERROR L253 erpolLogProxyWrapper]: Symbol error in Interpolant 86. Subtree only symbols: [(main_~pd2~0.offset_66 Int), (|~#d1~0.offset_2| Int), (main_~i~0_66 Int)]. Non-subtree only symbols: []. [2018-11-10 10:35:50,641 ERROR L253 erpolLogProxyWrapper]: Symbol error in Interpolant 87. Subtree only symbols: [(main_~pd2~0.offset_66 Int), (|~#d1~0.offset_2| Int), (main_~i~0_66 Int)]. Non-subtree only symbols: []. [2018-11-10 10:35:50,642 ERROR L253 erpolLogProxyWrapper]: Symbol error in Interpolant 88. Subtree only symbols: [(main_~pd2~0.offset_66 Int), (|~#d1~0.offset_2| Int), (main_~i~0_66 Int)]. Non-subtree only symbols: []. [2018-11-10 10:35:50,642 ERROR L253 erpolLogProxyWrapper]: Interpolant 89 not inductive: (Check returned sat) [2018-11-10 10:35:50,643 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: generated interpolants did not pass sanity check at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:1007) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:435) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-10 10:35:50,645 INFO L168 Benchmark]: Toolchain (without parser) took 10640.82 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 366.0 MB). Free memory was 959.8 MB in the beginning and 864.0 MB in the end (delta: 95.8 MB). Peak memory consumption was 461.8 MB. Max. memory is 11.5 GB. [2018-11-10 10:35:50,646 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:35:50,646 INFO L168 Benchmark]: CACSL2BoogieTranslator took 163.21 ms. Allocated memory is still 1.0 GB. Free memory was 959.8 MB in the beginning and 949.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 10:35:50,647 INFO L168 Benchmark]: Boogie Preprocessor took 28.97 ms. Allocated memory is still 1.0 GB. Free memory was 949.1 MB in the beginning and 946.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 10:35:50,647 INFO L168 Benchmark]: RCFGBuilder took 313.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.6 MB). Free memory was 946.4 MB in the beginning and 1.1 GB in the end (delta: -187.7 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. [2018-11-10 10:35:50,647 INFO L168 Benchmark]: TraceAbstraction took 10132.09 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 202.4 MB). Free memory was 1.1 GB in the beginning and 864.0 MB in the end (delta: 270.1 MB). Peak memory consumption was 472.5 MB. Max. memory is 11.5 GB. [2018-11-10 10:35:50,650 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 163.21 ms. Allocated memory is still 1.0 GB. Free memory was 959.8 MB in the beginning and 949.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.97 ms. Allocated memory is still 1.0 GB. Free memory was 949.1 MB in the beginning and 946.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 313.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.6 MB). Free memory was 946.4 MB in the beginning and 1.1 GB in the end (delta: -187.7 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10132.09 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 202.4 MB). Free memory was 1.1 GB in the beginning and 864.0 MB in the end (delta: 270.1 MB). Peak memory consumption was 472.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: generated interpolants did not pass sanity check de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: generated interpolants did not pass sanity check: de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:1007) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-1dbac8b [2018-11-10 10:35:52,078 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 10:35:52,080 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 10:35:52,087 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 10:35:52,087 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 10:35:52,088 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 10:35:52,088 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 10:35:52,090 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 10:35:52,091 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 10:35:52,091 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 10:35:52,092 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 10:35:52,092 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 10:35:52,093 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 10:35:52,094 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 10:35:52,094 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 10:35:52,095 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 10:35:52,095 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 10:35:52,097 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 10:35:52,099 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 10:35:52,100 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 10:35:52,100 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 10:35:52,101 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 10:35:52,103 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 10:35:52,103 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 10:35:52,103 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 10:35:52,104 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 10:35:52,105 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 10:35:52,106 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 10:35:52,106 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 10:35:52,107 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 10:35:52,107 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 10:35:52,108 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 10:35:52,108 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 10:35:52,108 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 10:35:52,109 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 10:35:52,110 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 10:35:52,110 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b2c579f4-c1d0-4c73-aed5-d708cd01dd5d/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-10 10:35:52,120 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 10:35:52,120 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 10:35:52,121 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 10:35:52,121 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 10:35:52,121 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 10:35:52,121 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 10:35:52,122 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 10:35:52,122 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 10:35:52,122 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 10:35:52,122 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 10:35:52,122 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 10:35:52,122 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 10:35:52,122 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 10:35:52,122 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 10:35:52,122 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-10 10:35:52,123 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-10 10:35:52,123 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 10:35:52,123 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 10:35:52,123 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 10:35:52,123 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 10:35:52,123 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 10:35:52,123 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 10:35:52,123 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 10:35:52,123 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 10:35:52,124 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 10:35:52,124 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 10:35:52,124 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 10:35:52,124 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-10 10:35:52,124 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 10:35:52,124 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-10 10:35:52,124 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-10 10:35:52,124 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_b2c579f4-c1d0-4c73-aed5-d708cd01dd5d/bin-2019/uautomizer 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 308e43cca528a064aecd41d099b341627e43bb71 [2018-11-10 10:35:52,152 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 10:35:52,159 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 10:35:52,161 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 10:35:52,162 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 10:35:52,163 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 10:35:52,163 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b2c579f4-c1d0-4c73-aed5-d708cd01dd5d/bin-2019/uautomizer/../../sv-benchmarks/c/ldv-regression/test23_true-unreach-call.c [2018-11-10 10:35:52,198 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b2c579f4-c1d0-4c73-aed5-d708cd01dd5d/bin-2019/uautomizer/data/cfbdd0b4b/44dfebcbc8cb47be9a6331a8de784835/FLAG99d547c34 [2018-11-10 10:35:52,589 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 10:35:52,590 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b2c579f4-c1d0-4c73-aed5-d708cd01dd5d/sv-benchmarks/c/ldv-regression/test23_true-unreach-call.c [2018-11-10 10:35:52,594 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b2c579f4-c1d0-4c73-aed5-d708cd01dd5d/bin-2019/uautomizer/data/cfbdd0b4b/44dfebcbc8cb47be9a6331a8de784835/FLAG99d547c34 [2018-11-10 10:35:52,603 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b2c579f4-c1d0-4c73-aed5-d708cd01dd5d/bin-2019/uautomizer/data/cfbdd0b4b/44dfebcbc8cb47be9a6331a8de784835 [2018-11-10 10:35:52,605 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 10:35:52,605 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 10:35:52,606 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 10:35:52,606 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 10:35:52,609 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 10:35:52,610 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:35:52" (1/1) ... [2018-11-10 10:35:52,612 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@405a00e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:35:52, skipping insertion in model container [2018-11-10 10:35:52,612 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:35:52" (1/1) ... [2018-11-10 10:35:52,618 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 10:35:52,633 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 10:35:52,749 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:35:52,761 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 10:35:52,779 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:35:52,802 INFO L193 MainTranslator]: Completed translation [2018-11-10 10:35:52,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:35:52 WrapperNode [2018-11-10 10:35:52,803 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 10:35:52,803 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 10:35:52,803 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 10:35:52,803 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 10:35:52,811 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:35:52" (1/1) ... [2018-11-10 10:35:52,812 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:35:52" (1/1) ... [2018-11-10 10:35:52,819 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:35:52" (1/1) ... [2018-11-10 10:35:52,819 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:35:52" (1/1) ... [2018-11-10 10:35:52,825 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:35:52" (1/1) ... [2018-11-10 10:35:52,828 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:35:52" (1/1) ... [2018-11-10 10:35:52,829 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:35:52" (1/1) ... [2018-11-10 10:35:52,831 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 10:35:52,831 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 10:35:52,831 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 10:35:52,832 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 10:35:52,832 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:35:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b2c579f4-c1d0-4c73-aed5-d708cd01dd5d/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 10:35:52,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 10:35:52,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 10:35:52,911 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2018-11-10 10:35:52,911 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dummy [2018-11-10 10:35:52,911 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2018-11-10 10:35:52,911 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 10:35:52,911 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 10:35:52,911 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-10 10:35:52,911 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2018-11-10 10:35:52,912 INFO L130 BoogieDeclarations]: Found specification of procedure init [2018-11-10 10:35:52,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-10 10:35:52,912 INFO L130 BoogieDeclarations]: Found specification of procedure get_dummy [2018-11-10 10:35:52,912 INFO L130 BoogieDeclarations]: Found specification of procedure check [2018-11-10 10:35:52,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-10 10:35:52,912 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 10:35:52,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 10:35:52,912 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-10 10:35:52,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-10 10:35:52,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 10:35:52,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-10 10:35:53,200 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 10:35:53,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:35:53 BoogieIcfgContainer [2018-11-10 10:35:53,200 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 10:35:53,201 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 10:35:53,201 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 10:35:53,202 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 10:35:53,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 10:35:52" (1/3) ... [2018-11-10 10:35:53,203 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d037b39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:35:53, skipping insertion in model container [2018-11-10 10:35:53,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:35:52" (2/3) ... [2018-11-10 10:35:53,203 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d037b39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:35:53, skipping insertion in model container [2018-11-10 10:35:53,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:35:53" (3/3) ... [2018-11-10 10:35:53,205 INFO L112 eAbstractionObserver]: Analyzing ICFG test23_true-unreach-call.c [2018-11-10 10:35:53,210 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 10:35:53,215 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 10:35:53,225 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 10:35:53,245 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 10:35:53,246 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 10:35:53,246 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 10:35:53,246 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 10:35:53,246 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 10:35:53,246 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 10:35:53,246 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 10:35:53,246 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 10:35:53,247 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 10:35:53,257 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states. [2018-11-10 10:35:53,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-10 10:35:53,262 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:35:53,263 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:35:53,264 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:35:53,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:35:53,268 INFO L82 PathProgramCache]: Analyzing trace with hash -500234195, now seen corresponding path program 1 times [2018-11-10 10:35:53,272 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:35:53,272 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b2c579f4-c1d0-4c73-aed5-d708cd01dd5d/bin-2019/uautomizer/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:35:53,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:35:53,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:35:53,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:35:53,392 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 10:35:53,393 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:35:53,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:35:53,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 10:35:53,399 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 10:35:53,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 10:35:53,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 10:35:53,413 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 2 states. [2018-11-10 10:35:53,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:35:53,436 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2018-11-10 10:35:53,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 10:35:53,437 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 80 [2018-11-10 10:35:53,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:35:53,446 INFO L225 Difference]: With dead ends: 98 [2018-11-10 10:35:53,446 INFO L226 Difference]: Without dead ends: 79 [2018-11-10 10:35:53,449 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 79 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-11-10 10:35:53,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-10 10:35:53,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-11-10 10:35:53,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-10 10:35:53,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2018-11-10 10:35:53,485 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 81 transitions. Word has length 80 [2018-11-10 10:35:53,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:35:53,486 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 81 transitions. [2018-11-10 10:35:53,487 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 10:35:53,487 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2018-11-10 10:35:53,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-10 10:35:53,489 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:35:53,489 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:35:53,490 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:35:53,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:35:53,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1981203993, now seen corresponding path program 1 times [2018-11-10 10:35:53,491 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:35:53,491 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b2c579f4-c1d0-4c73-aed5-d708cd01dd5d/bin-2019/uautomizer/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:35:53,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:35:53,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:35:53,580 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:35:53,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-10 10:35:53,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-11-10 10:35:53,768 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:35:53,772 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:53,790 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:53,791 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-11-10 10:35:54,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2018-11-10 10:35:54,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 9 [2018-11-10 10:35:54,044 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:35:54,057 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:54,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:54,075 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:12 [2018-11-10 10:35:54,173 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 10:35:54,173 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:35:54,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:35:54,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-11-10 10:35:54,178 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-10 10:35:54,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 10:35:54,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-11-10 10:35:54,179 INFO L87 Difference]: Start difference. First operand 79 states and 81 transitions. Second operand 15 states. [2018-11-10 10:35:55,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:35:55,516 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2018-11-10 10:35:55,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 10:35:55,517 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 82 [2018-11-10 10:35:55,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:35:55,519 INFO L225 Difference]: With dead ends: 111 [2018-11-10 10:35:55,519 INFO L226 Difference]: Without dead ends: 102 [2018-11-10 10:35:55,520 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2018-11-10 10:35:55,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-10 10:35:55,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 93. [2018-11-10 10:35:55,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-10 10:35:55,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 98 transitions. [2018-11-10 10:35:55,529 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 98 transitions. Word has length 82 [2018-11-10 10:35:55,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:35:55,529 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 98 transitions. [2018-11-10 10:35:55,529 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-10 10:35:55,530 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2018-11-10 10:35:55,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-10 10:35:55,531 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:35:55,531 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:35:55,531 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:35:55,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:35:55,532 INFO L82 PathProgramCache]: Analyzing trace with hash 390535269, now seen corresponding path program 1 times [2018-11-10 10:35:55,532 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:35:55,532 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b2c579f4-c1d0-4c73-aed5-d708cd01dd5d/bin-2019/uautomizer/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:35:55,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:35:55,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:35:55,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:35:55,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 10:35:55,606 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:35:55,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:55,612 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-10 10:35:55,617 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:35:55,618 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:35:55,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-10 10:35:55,619 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:35:55,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:55,620 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-11-10 10:35:55,689 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:35:55,689 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:35:55,766 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 10:35:55,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:35:55,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 14 [2018-11-10 10:35:55,768 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 10:35:55,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 10:35:55,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-11-10 10:35:55,768 INFO L87 Difference]: Start difference. First operand 93 states and 98 transitions. Second operand 14 states. [2018-11-10 10:35:56,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:35:56,415 INFO L93 Difference]: Finished difference Result 118 states and 124 transitions. [2018-11-10 10:35:56,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 10:35:56,415 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 82 [2018-11-10 10:35:56,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:35:56,417 INFO L225 Difference]: With dead ends: 118 [2018-11-10 10:35:56,417 INFO L226 Difference]: Without dead ends: 100 [2018-11-10 10:35:56,417 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 151 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2018-11-10 10:35:56,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-11-10 10:35:56,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 93. [2018-11-10 10:35:56,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-10 10:35:56,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2018-11-10 10:35:56,423 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 82 [2018-11-10 10:35:56,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:35:56,423 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2018-11-10 10:35:56,423 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 10:35:56,423 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2018-11-10 10:35:56,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-10 10:35:56,425 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:35:56,425 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:35:56,425 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:35:56,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:35:56,425 INFO L82 PathProgramCache]: Analyzing trace with hash -32166557, now seen corresponding path program 1 times [2018-11-10 10:35:56,426 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:35:56,426 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b2c579f4-c1d0-4c73-aed5-d708cd01dd5d/bin-2019/uautomizer/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:35:56,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:35:56,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:35:56,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:35:56,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-10 10:35:56,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-11-10 10:35:56,641 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:35:56,644 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:56,660 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:56,660 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-11-10 10:35:56,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2018-11-10 10:35:56,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 12 [2018-11-10 10:35:56,849 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:35:56,855 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:56,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:56,861 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:12 [2018-11-10 10:35:56,902 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 10:35:56,902 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:35:56,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:35:56,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-10 10:35:56,904 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 10:35:56,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 10:35:56,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2018-11-10 10:35:56,904 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand 14 states. [2018-11-10 10:35:59,062 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2018-11-10 10:35:59,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:35:59,276 INFO L93 Difference]: Finished difference Result 112 states and 117 transitions. [2018-11-10 10:35:59,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-10 10:35:59,276 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 82 [2018-11-10 10:35:59,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:35:59,277 INFO L225 Difference]: With dead ends: 112 [2018-11-10 10:35:59,277 INFO L226 Difference]: Without dead ends: 103 [2018-11-10 10:35:59,278 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=116, Invalid=534, Unknown=0, NotChecked=0, Total=650 [2018-11-10 10:35:59,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-10 10:35:59,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 87. [2018-11-10 10:35:59,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-10 10:35:59,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2018-11-10 10:35:59,284 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 82 [2018-11-10 10:35:59,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:35:59,285 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2018-11-10 10:35:59,285 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 10:35:59,285 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2018-11-10 10:35:59,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-10 10:35:59,286 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:35:59,286 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:35:59,286 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:35:59,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:35:59,286 INFO L82 PathProgramCache]: Analyzing trace with hash -765644194, now seen corresponding path program 1 times [2018-11-10 10:35:59,287 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:35:59,287 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b2c579f4-c1d0-4c73-aed5-d708cd01dd5d/bin-2019/uautomizer/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:35:59,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:35:59,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:35:59,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:35:59,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-10 10:35:59,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-11-10 10:35:59,497 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:35:59,500 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:59,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:59,514 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-11-10 10:35:59,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2018-11-10 10:35:59,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 9 [2018-11-10 10:35:59,712 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:35:59,717 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:59,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:59,725 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:12 [2018-11-10 10:35:59,776 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 10:35:59,776 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:36:00,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2018-11-10 10:36:00,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-11-10 10:36:00,165 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:36:00,170 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:36:00,207 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-11-10 10:36:00,208 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:44 [2018-11-10 10:36:00,682 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 10:36:00,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:36:00,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 29 [2018-11-10 10:36:00,685 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-10 10:36:00,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-10 10:36:00,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2018-11-10 10:36:00,686 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand 29 states. [2018-11-10 10:36:03,017 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2018-11-10 10:36:03,239 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 27 [2018-11-10 10:36:04,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:36:04,812 INFO L93 Difference]: Finished difference Result 126 states and 134 transitions. [2018-11-10 10:36:04,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-10 10:36:04,812 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 85 [2018-11-10 10:36:04,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:36:04,813 INFO L225 Difference]: With dead ends: 126 [2018-11-10 10:36:04,813 INFO L226 Difference]: Without dead ends: 117 [2018-11-10 10:36:04,814 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 498 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=399, Invalid=2253, Unknown=0, NotChecked=0, Total=2652 [2018-11-10 10:36:04,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-10 10:36:04,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 102. [2018-11-10 10:36:04,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-10 10:36:04,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 106 transitions. [2018-11-10 10:36:04,823 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 106 transitions. Word has length 85 [2018-11-10 10:36:04,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:36:04,823 INFO L481 AbstractCegarLoop]: Abstraction has 102 states and 106 transitions. [2018-11-10 10:36:04,823 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-10 10:36:04,823 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 106 transitions. [2018-11-10 10:36:04,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-10 10:36:04,826 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:36:04,826 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:36:04,826 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:36:04,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:36:04,826 INFO L82 PathProgramCache]: Analyzing trace with hash -743786237, now seen corresponding path program 1 times [2018-11-10 10:36:04,827 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:36:04,827 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b2c579f4-c1d0-4c73-aed5-d708cd01dd5d/bin-2019/uautomizer/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:36:04,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:36:04,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:36:04,940 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:36:05,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-10 10:36:05,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-11-10 10:36:05,033 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:36:05,037 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:36:05,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:36:05,064 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-11-10 10:36:05,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2018-11-10 10:36:05,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 12 [2018-11-10 10:36:05,547 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:36:05,554 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:36:05,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:36:05,561 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:12 [2018-11-10 10:36:05,614 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 10:36:05,614 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:36:12,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2018-11-10 10:36:12,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 12 [2018-11-10 10:36:12,412 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:36:12,422 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:36:12,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-10 10:36:12,437 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:56, output treesize:31 [2018-11-10 10:36:12,688 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 10:36:12,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:36:12,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 26 [2018-11-10 10:36:12,690 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-10 10:36:12,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-10 10:36:12,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=569, Unknown=3, NotChecked=0, Total=650 [2018-11-10 10:36:12,690 INFO L87 Difference]: Start difference. First operand 102 states and 106 transitions. Second operand 26 states. [2018-11-10 10:36:14,365 WARN L179 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 24 [2018-11-10 10:36:31,624 WARN L179 SmtUtils]: Spent 17.10 s on a formula simplification. DAG size of input: 49 DAG size of output: 30 [2018-11-10 10:36:49,749 WARN L179 SmtUtils]: Spent 16.24 s on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2018-11-10 10:37:09,016 WARN L179 SmtUtils]: Spent 19.13 s on a formula simplification. DAG size of input: 53 DAG size of output: 34 [2018-11-10 10:37:10,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:37:10,266 INFO L93 Difference]: Finished difference Result 142 states and 152 transitions. [2018-11-10 10:37:10,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-10 10:37:10,267 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 88 [2018-11-10 10:37:10,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:37:10,268 INFO L225 Difference]: With dead ends: 142 [2018-11-10 10:37:10,268 INFO L226 Difference]: Without dead ends: 133 [2018-11-10 10:37:10,269 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 63.2s TimeCoverageRelationStatistics Valid=557, Invalid=2746, Unknown=3, NotChecked=0, Total=3306 [2018-11-10 10:37:10,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-10 10:37:10,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 102. [2018-11-10 10:37:10,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-10 10:37:10,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 106 transitions. [2018-11-10 10:37:10,281 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 106 transitions. Word has length 88 [2018-11-10 10:37:10,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:37:10,281 INFO L481 AbstractCegarLoop]: Abstraction has 102 states and 106 transitions. [2018-11-10 10:37:10,281 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-10 10:37:10,281 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 106 transitions. [2018-11-10 10:37:10,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-10 10:37:10,282 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:37:10,282 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:37:10,283 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:37:10,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:37:10,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1823106105, now seen corresponding path program 2 times [2018-11-10 10:37:10,283 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:37:10,283 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b2c579f4-c1d0-4c73-aed5-d708cd01dd5d/bin-2019/uautomizer/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:37:10,300 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-10 10:37:10,510 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 10:37:10,510 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 10:37:10,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:37:10,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-10 10:37:10,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-11-10 10:37:10,598 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:37:10,601 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:37:10,617 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:37:10,617 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-11-10 10:37:11,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2018-11-10 10:37:11,777 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:37:11,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-11-10 10:37:11,779 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:37:11,784 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:37:11,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:37:11,794 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:15 [2018-11-10 10:37:11,883 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 3 proven. 63 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 10:37:11,883 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:37:14,004 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 27 [2018-11-10 10:37:14,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-11-10 10:37:14,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 18 [2018-11-10 10:37:14,013 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:37:14,036 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:37:14,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-10 10:37:14,064 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:84, output treesize:43 [2018-11-10 10:37:14,478 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 10:37:14,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:37:14,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 18] total 39 [2018-11-10 10:37:14,481 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-10 10:37:14,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-10 10:37:14,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=1246, Unknown=0, NotChecked=0, Total=1482 [2018-11-10 10:37:14,481 INFO L87 Difference]: Start difference. First operand 102 states and 106 transitions. Second operand 39 states. [2018-11-10 10:37:17,120 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 33 [2018-11-10 10:37:17,591 WARN L179 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 35 [2018-11-10 10:37:18,096 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 33 [2018-11-10 10:37:18,623 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 35 [2018-11-10 10:37:19,206 WARN L179 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 33 [2018-11-10 10:37:19,733 WARN L179 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 36 [2018-11-10 10:37:20,290 WARN L179 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 33 [2018-11-10 10:37:20,790 WARN L179 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 36 [2018-11-10 10:37:21,355 WARN L179 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 33 [2018-11-10 10:37:21,901 WARN L179 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 36 [2018-11-10 10:37:22,448 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 33 [2018-11-10 10:37:22,976 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 36 [2018-11-10 10:37:23,495 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 32 [2018-11-10 10:37:24,008 WARN L179 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 36 [2018-11-10 10:37:26,259 WARN L179 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 92 DAG size of output: 83 [2018-11-10 10:37:28,396 WARN L179 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 92 DAG size of output: 84 [2018-11-10 10:37:28,950 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 34 [2018-11-10 10:37:29,308 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 35 [2018-11-10 10:37:30,132 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2018-11-10 10:37:30,570 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2018-11-10 10:37:30,862 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2018-11-10 10:37:33,576 WARN L179 SmtUtils]: Spent 405.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-11-10 10:37:34,599 WARN L179 SmtUtils]: Spent 431.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2018-11-10 10:37:35,609 WARN L179 SmtUtils]: Spent 450.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2018-11-10 10:37:37,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:37:37,198 INFO L93 Difference]: Finished difference Result 173 states and 186 transitions. [2018-11-10 10:37:37,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-11-10 10:37:37,199 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 100 [2018-11-10 10:37:37,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:37:37,199 INFO L225 Difference]: With dead ends: 173 [2018-11-10 10:37:37,200 INFO L226 Difference]: Without dead ends: 164 [2018-11-10 10:37:37,201 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 162 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2090 ImplicationChecksByTransitivity, 22.0s TimeCoverageRelationStatistics Valid=1190, Invalid=5950, Unknown=0, NotChecked=0, Total=7140 [2018-11-10 10:37:37,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-11-10 10:37:37,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 144. [2018-11-10 10:37:37,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-11-10 10:37:37,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 149 transitions. [2018-11-10 10:37:37,214 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 149 transitions. Word has length 100 [2018-11-10 10:37:37,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:37:37,214 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 149 transitions. [2018-11-10 10:37:37,215 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-10 10:37:37,215 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 149 transitions. [2018-11-10 10:37:37,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-10 10:37:37,215 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:37:37,215 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:37:37,215 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:37:37,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:37:37,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1596234304, now seen corresponding path program 1 times [2018-11-10 10:37:37,216 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:37:37,216 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b2c579f4-c1d0-4c73-aed5-d708cd01dd5d/bin-2019/uautomizer/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:37:37,232 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:37:37,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:37:37,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:37:37,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 10:37:37,308 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:37:37,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:37:37,313 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-10 10:37:37,317 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:37:37,320 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:37:37,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-10 10:37:37,321 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:37:37,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:37:37,323 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-11-10 10:37:37,383 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-10 10:37:37,383 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:37:37,440 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-11-10 10:37:37,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:37:37,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 14 [2018-11-10 10:37:37,442 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 10:37:37,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 10:37:37,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-11-10 10:37:37,443 INFO L87 Difference]: Start difference. First operand 144 states and 149 transitions. Second operand 14 states. [2018-11-10 10:37:38,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:37:38,046 INFO L93 Difference]: Finished difference Result 199 states and 205 transitions. [2018-11-10 10:37:38,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 10:37:38,046 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 103 [2018-11-10 10:37:38,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:37:38,047 INFO L225 Difference]: With dead ends: 199 [2018-11-10 10:37:38,047 INFO L226 Difference]: Without dead ends: 160 [2018-11-10 10:37:38,047 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 193 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2018-11-10 10:37:38,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-11-10 10:37:38,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 144. [2018-11-10 10:37:38,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-11-10 10:37:38,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 148 transitions. [2018-11-10 10:37:38,060 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 148 transitions. Word has length 103 [2018-11-10 10:37:38,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:37:38,061 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 148 transitions. [2018-11-10 10:37:38,061 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 10:37:38,061 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 148 transitions. [2018-11-10 10:37:38,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-10 10:37:38,062 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:37:38,062 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:37:38,062 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:37:38,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:37:38,062 INFO L82 PathProgramCache]: Analyzing trace with hash -342927742, now seen corresponding path program 2 times [2018-11-10 10:37:38,063 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:37:38,063 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b2c579f4-c1d0-4c73-aed5-d708cd01dd5d/bin-2019/uautomizer/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:37:38,094 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-10 10:37:38,289 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 10:37:38,289 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 10:37:38,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:37:38,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-10 10:37:38,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-11-10 10:37:38,369 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:37:38,373 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:37:38,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:37:38,407 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-11-10 10:37:39,157 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2018-11-10 10:37:39,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 12 [2018-11-10 10:37:39,159 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:37:39,166 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:37:39,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:37:39,172 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:12 [2018-11-10 10:37:39,240 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 3 proven. 84 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 10:37:39,240 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:37:52,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2018-11-10 10:37:52,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 12 [2018-11-10 10:37:52,072 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:37:52,084 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:37:52,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2018-11-10 10:37:52,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 12 [2018-11-10 10:37:52,093 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:37:52,106 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:37:52,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-10 10:37:52,134 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:56, output treesize:31 [2018-11-10 10:37:52,392 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 10:37:52,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:37:52,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 32 [2018-11-10 10:37:52,394 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-10 10:37:52,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-10 10:37:52,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=839, Unknown=4, NotChecked=0, Total=992 [2018-11-10 10:37:52,395 INFO L87 Difference]: Start difference. First operand 144 states and 148 transitions. Second operand 32 states. [2018-11-10 10:38:26,769 WARN L179 SmtUtils]: Spent 32.41 s on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2018-11-10 10:38:48,589 WARN L179 SmtUtils]: Spent 21.61 s on a formula simplification. DAG size of input: 54 DAG size of output: 30 [2018-11-10 10:38:49,066 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 19 [2018-11-10 10:38:49,629 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 21 [2018-11-10 10:38:50,175 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 20 [2018-11-10 10:38:50,674 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 22 [2018-11-10 10:38:51,346 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 20 [2018-11-10 10:38:51,837 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 22 [2018-11-10 10:38:52,447 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 20 [2018-11-10 10:38:53,057 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 22 [2018-11-10 10:38:53,562 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 20 [2018-11-10 10:38:54,027 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 22 [2018-11-10 10:38:54,599 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 20 [2018-11-10 10:38:55,117 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 22 [2018-11-10 10:38:55,684 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 20 [2018-11-10 10:38:56,281 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 22 [2018-11-10 10:38:56,817 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 20 [2018-11-10 10:38:57,412 WARN L179 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 24 [2018-11-10 10:38:59,144 WARN L179 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 83 DAG size of output: 77 [2018-11-10 10:39:00,899 WARN L179 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2018-11-10 10:39:01,176 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-11-10 10:39:01,438 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-11-10 10:39:06,222 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 20 [2018-11-10 10:39:06,541 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 21 [2018-11-10 10:39:07,081 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 18 [2018-11-10 10:39:07,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:39:07,892 INFO L93 Difference]: Finished difference Result 193 states and 205 transitions. [2018-11-10 10:39:07,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-10 10:39:07,893 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 103 [2018-11-10 10:39:07,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:39:07,893 INFO L225 Difference]: With dead ends: 193 [2018-11-10 10:39:07,893 INFO L226 Difference]: Without dead ends: 184 [2018-11-10 10:39:07,894 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 813 ImplicationChecksByTransitivity, 86.8s TimeCoverageRelationStatistics Valid=751, Invalid=3403, Unknown=6, NotChecked=0, Total=4160 [2018-11-10 10:39:07,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-11-10 10:39:07,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 132. [2018-11-10 10:39:07,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-11-10 10:39:07,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 136 transitions. [2018-11-10 10:39:07,908 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 136 transitions. Word has length 103 [2018-11-10 10:39:07,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:39:07,908 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 136 transitions. [2018-11-10 10:39:07,908 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-10 10:39:07,908 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 136 transitions. [2018-11-10 10:39:07,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-10 10:39:07,909 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:39:07,909 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:39:07,909 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:39:07,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:39:07,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1530198777, now seen corresponding path program 3 times [2018-11-10 10:39:07,910 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:39:07,910 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b2c579f4-c1d0-4c73-aed5-d708cd01dd5d/bin-2019/uautomizer/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:39:07,926 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-10 10:39:08,127 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-10 10:39:08,127 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 10:39:08,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:39:08,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-10 10:39:08,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-11-10 10:39:08,197 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:39:08,200 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:08,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:08,215 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-11-10 10:39:09,439 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 32 proven. 10 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2018-11-10 10:39:09,439 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:39:10,927 WARN L179 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 34 [2018-11-10 10:39:10,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 47 [2018-11-10 10:39:11,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-11-10 10:39:11,034 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:39:11,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2018-11-10 10:39:11,073 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:39:11,087 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:39:11,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 55 [2018-11-10 10:39:11,278 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2018-11-10 10:39:11,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 31 [2018-11-10 10:39:11,290 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:39:11,295 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 33 [2018-11-10 10:39:11,295 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:39:11,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2018-11-10 10:39:11,433 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 10:39:11,676 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:39:11,694 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:39:11,695 INFO L303 Elim1Store]: Index analysis took 151 ms [2018-11-10 10:39:11,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 39 [2018-11-10 10:39:11,696 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:39:11,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 28 [2018-11-10 10:39:11,702 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:39:11,811 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-11-10 10:39:11,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 10 dim-0 vars, and 5 xjuncts. [2018-11-10 10:39:11,945 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:76, output treesize:130 [2018-11-10 10:39:18,218 WARN L179 SmtUtils]: Spent 6.05 s on a formula simplification. DAG size of input: 76 DAG size of output: 7 [2018-11-10 10:39:18,265 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2018-11-10 10:39:18,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:39:18,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13] total 30 [2018-11-10 10:39:18,267 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-10 10:39:18,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-10 10:39:18,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=770, Unknown=0, NotChecked=0, Total=870 [2018-11-10 10:39:18,268 INFO L87 Difference]: Start difference. First operand 132 states and 136 transitions. Second operand 30 states. [2018-11-10 10:40:40,455 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2018-11-10 10:40:41,289 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2018-11-10 10:40:42,373 WARN L179 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2018-11-10 10:40:44,715 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2018-11-10 10:40:49,011 WARN L179 SmtUtils]: Spent 2.07 s on a formula simplification that was a NOOP. DAG size: 37 [2018-11-10 10:40:51,370 WARN L179 SmtUtils]: Spent 2.13 s on a formula simplification that was a NOOP. DAG size: 51 [2018-11-10 10:41:07,979 WARN L179 SmtUtils]: Spent 13.77 s on a formula simplification that was a NOOP. DAG size: 43 [2018-11-10 10:41:13,434 WARN L179 SmtUtils]: Spent 2.21 s on a formula simplification that was a NOOP. DAG size: 54 [2018-11-10 10:41:13,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:41:13,436 INFO L93 Difference]: Finished difference Result 196 states and 202 transitions. [2018-11-10 10:41:13,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-10 10:41:13,436 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 112 [2018-11-10 10:41:13,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:41:13,437 INFO L225 Difference]: With dead ends: 196 [2018-11-10 10:41:13,437 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 10:41:13,438 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 194 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 745 ImplicationChecksByTransitivity, 34.6s TimeCoverageRelationStatistics Valid=387, Invalid=2582, Unknown=1, NotChecked=0, Total=2970 [2018-11-10 10:41:13,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 10:41:13,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 10:41:13,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 10:41:13,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 10:41:13,439 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 112 [2018-11-10 10:41:13,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:41:13,439 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 10:41:13,439 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-10 10:41:13,439 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 10:41:13,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 10:41:13,442 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 10:41:13,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:41:13,857 WARN L179 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 386 DAG size of output: 313 [2018-11-10 10:41:20,988 WARN L179 SmtUtils]: Spent 7.02 s on a formula simplification. DAG size of input: 124 DAG size of output: 62 [2018-11-10 10:41:25,773 WARN L179 SmtUtils]: Spent 4.72 s on a formula simplification. DAG size of input: 311 DAG size of output: 48 [2018-11-10 10:41:25,776 INFO L425 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2018-11-10 10:41:25,777 INFO L425 ceAbstractionStarter]: For program point L18-1(line 18) no Hoare annotation was computed. [2018-11-10 10:41:25,777 INFO L425 ceAbstractionStarter]: For program point L17-1(line 17) no Hoare annotation was computed. [2018-11-10 10:41:25,777 INFO L425 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2018-11-10 10:41:25,777 INFO L425 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2018-11-10 10:41:25,777 INFO L425 ceAbstractionStarter]: For program point L15-1(line 15) no Hoare annotation was computed. [2018-11-10 10:41:25,777 INFO L425 ceAbstractionStarter]: For program point initEXIT(lines 12 19) no Hoare annotation was computed. [2018-11-10 10:41:25,777 INFO L428 ceAbstractionStarter]: At program point initENTRY(lines 12 19) the Hoare annotation is: true [2018-11-10 10:41:25,777 INFO L425 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. [2018-11-10 10:41:25,777 INFO L425 ceAbstractionStarter]: For program point initFINAL(lines 12 19) no Hoare annotation was computed. [2018-11-10 10:41:25,777 INFO L425 ceAbstractionStarter]: For program point L10-9(line 10) no Hoare annotation was computed. [2018-11-10 10:41:25,777 INFO L425 ceAbstractionStarter]: For program point L10-10(line 10) no Hoare annotation was computed. [2018-11-10 10:41:25,777 INFO L425 ceAbstractionStarter]: For program point L10-11(line 10) no Hoare annotation was computed. [2018-11-10 10:41:25,777 INFO L425 ceAbstractionStarter]: For program point L10-12(line 10) no Hoare annotation was computed. [2018-11-10 10:41:25,777 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line 10) no Hoare annotation was computed. [2018-11-10 10:41:25,777 INFO L425 ceAbstractionStarter]: For program point L10-13(line 10) no Hoare annotation was computed. [2018-11-10 10:41:25,777 INFO L425 ceAbstractionStarter]: For program point L10-14(line 10) no Hoare annotation was computed. [2018-11-10 10:41:25,777 INFO L425 ceAbstractionStarter]: For program point L10-15(line 10) no Hoare annotation was computed. [2018-11-10 10:41:25,777 INFO L425 ceAbstractionStarter]: For program point L10-16(line 10) no Hoare annotation was computed. [2018-11-10 10:41:25,777 INFO L425 ceAbstractionStarter]: For program point L10-17(line 10) no Hoare annotation was computed. [2018-11-10 10:41:25,777 INFO L425 ceAbstractionStarter]: For program point L10-18(line 10) no Hoare annotation was computed. [2018-11-10 10:41:25,777 INFO L425 ceAbstractionStarter]: For program point L10-19(line 10) no Hoare annotation was computed. [2018-11-10 10:41:25,778 INFO L425 ceAbstractionStarter]: For program point L10-20(line 10) no Hoare annotation was computed. [2018-11-10 10:41:25,778 INFO L425 ceAbstractionStarter]: For program point L10-21(line 10) no Hoare annotation was computed. [2018-11-10 10:41:25,778 INFO L425 ceAbstractionStarter]: For program point L10-22(line 10) no Hoare annotation was computed. [2018-11-10 10:41:25,778 INFO L425 ceAbstractionStarter]: For program point L10-23(line 10) no Hoare annotation was computed. [2018-11-10 10:41:25,778 INFO L425 ceAbstractionStarter]: For program point L10-24(line 10) no Hoare annotation was computed. [2018-11-10 10:41:25,778 INFO L425 ceAbstractionStarter]: For program point L10-25(line 10) no Hoare annotation was computed. [2018-11-10 10:41:25,778 INFO L425 ceAbstractionStarter]: For program point L10-26(line 10) no Hoare annotation was computed. [2018-11-10 10:41:25,778 INFO L425 ceAbstractionStarter]: For program point L10-27(line 10) no Hoare annotation was computed. [2018-11-10 10:41:25,778 INFO L425 ceAbstractionStarter]: For program point L10-28(line 10) no Hoare annotation was computed. [2018-11-10 10:41:25,778 INFO L425 ceAbstractionStarter]: For program point L10-29(line 10) no Hoare annotation was computed. [2018-11-10 10:41:25,778 INFO L425 ceAbstractionStarter]: For program point L10-30(line 10) no Hoare annotation was computed. [2018-11-10 10:41:25,778 INFO L425 ceAbstractionStarter]: For program point L10-31(line 10) no Hoare annotation was computed. [2018-11-10 10:41:25,778 INFO L425 ceAbstractionStarter]: For program point L10-32(line 10) no Hoare annotation was computed. [2018-11-10 10:41:25,778 INFO L425 ceAbstractionStarter]: For program point L10-33(line 10) no Hoare annotation was computed. [2018-11-10 10:41:25,778 INFO L425 ceAbstractionStarter]: For program point L10-34(line 10) no Hoare annotation was computed. [2018-11-10 10:41:25,778 INFO L425 ceAbstractionStarter]: For program point L10-35(line 10) no Hoare annotation was computed. [2018-11-10 10:41:25,778 INFO L425 ceAbstractionStarter]: For program point L10-36(line 10) no Hoare annotation was computed. [2018-11-10 10:41:25,778 INFO L425 ceAbstractionStarter]: For program point L10-37(line 10) no Hoare annotation was computed. [2018-11-10 10:41:25,778 INFO L425 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. [2018-11-10 10:41:25,778 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-10 10:41:25,778 INFO L425 ceAbstractionStarter]: For program point L10-1(line 10) no Hoare annotation was computed. [2018-11-10 10:41:25,778 INFO L425 ceAbstractionStarter]: For program point L10-2(line 10) no Hoare annotation was computed. [2018-11-10 10:41:25,778 INFO L425 ceAbstractionStarter]: For program point L10-3(line 10) no Hoare annotation was computed. [2018-11-10 10:41:25,778 INFO L425 ceAbstractionStarter]: For program point L10-4(line 10) no Hoare annotation was computed. [2018-11-10 10:41:25,779 INFO L425 ceAbstractionStarter]: For program point L10-5(line 10) no Hoare annotation was computed. [2018-11-10 10:41:25,779 INFO L425 ceAbstractionStarter]: For program point L10-6(line 10) no Hoare annotation was computed. [2018-11-10 10:41:25,779 INFO L425 ceAbstractionStarter]: For program point L10-7(line 10) no Hoare annotation was computed. [2018-11-10 10:41:25,779 INFO L425 ceAbstractionStarter]: For program point L10-8(line 10) no Hoare annotation was computed. [2018-11-10 10:41:25,779 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 10:41:25,779 INFO L425 ceAbstractionStarter]: For program point get_dummyFINAL(lines 21 24) no Hoare annotation was computed. [2018-11-10 10:41:25,779 INFO L428 ceAbstractionStarter]: At program point get_dummyENTRY(lines 21 24) the Hoare annotation is: true [2018-11-10 10:41:25,779 INFO L425 ceAbstractionStarter]: For program point L23-1(line 23) no Hoare annotation was computed. [2018-11-10 10:41:25,779 INFO L425 ceAbstractionStarter]: For program point get_dummyEXIT(lines 21 24) no Hoare annotation was computed. [2018-11-10 10:41:25,779 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 10:41:25,779 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= (_ bv0 32) |~#d2~0.offset|) (not (= |~#d1~0.base| |~#d2~0.base|)) (= (_ bv1 1) (select |#valid| |~#d1~0.base|))) [2018-11-10 10:41:25,779 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 10:41:25,779 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 10:41:25,779 INFO L428 ceAbstractionStarter]: At program point L33(line 33) the Hoare annotation is: true [2018-11-10 10:41:25,779 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 31 52) no Hoare annotation was computed. [2018-11-10 10:41:25,779 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 31 52) no Hoare annotation was computed. [2018-11-10 10:41:25,779 INFO L421 ceAbstractionStarter]: At program point L44(lines 32 52) the Hoare annotation is: (or (= |~#d1~0.base| |~#d2~0.base|) (not (= |~#d2~0.offset| (_ bv0 32))) (not (= (bvadd (select |#valid| |~#d1~0.base|) (_ bv1 1)) (_ bv0 1)))) [2018-11-10 10:41:25,779 INFO L425 ceAbstractionStarter]: For program point L40-1(lines 40 42) no Hoare annotation was computed. [2018-11-10 10:41:25,779 INFO L425 ceAbstractionStarter]: For program point L40-2(lines 40 42) no Hoare annotation was computed. [2018-11-10 10:41:25,779 INFO L425 ceAbstractionStarter]: For program point L36(lines 36 46) no Hoare annotation was computed. [2018-11-10 10:41:25,779 INFO L421 ceAbstractionStarter]: At program point L40-4(lines 40 42) the Hoare annotation is: (or (and (forall ((main_~i~0 (_ BitVec 32))) (let ((.cse0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (or (bvslt (bvadd main_~i~0 (_ bv1 32)) .cse0) (= (bvadd (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) main_~i~0) main_~pd2~0.offset (_ bv12 32))) (_ bv4294967295 32)) main_~i~0) (not (bvslt main_~i~0 .cse0))))) (or (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= main_~i~0 (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) main_~i~0) main_~pd2~0.offset (_ bv8 32))))) (and (= main_~pd2~0.base main_~pd1~0.base) (= main_~pd1~0.offset main_~pd2~0.offset))) (not (= (bvadd (select |#valid| |~#d1~0.base|) (_ bv1 1)) (_ bv0 1))) (= |~#d1~0.base| |~#d2~0.base|) (not (= |~#d2~0.offset| (_ bv0 32)))) [2018-11-10 10:41:25,780 INFO L421 ceAbstractionStarter]: At program point L40-5(lines 40 42) the Hoare annotation is: (or (= |~#d1~0.base| |~#d2~0.base|) (and (and (= main_~pd2~0.base main_~pd1~0.base) (= main_~pd1~0.offset main_~pd2~0.offset)) (forall ((main_~i~0 (_ BitVec 32))) (let ((.cse0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (or (bvslt (bvadd main_~i~0 (_ bv1 32)) .cse0) (= (bvadd (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) main_~i~0) main_~pd2~0.offset (_ bv12 32))) (_ bv4294967295 32)) main_~i~0) (not (bvslt main_~i~0 .cse0))))) (forall ((v_subst_4 (_ BitVec 32))) (let ((.cse1 (select (select |#memory_int| main_~pd1~0.base) (bvadd main_~pd1~0.offset (bvmul (_ bv4 32) main_~i~0) (_ bv8 32))))) (or (not (bvslt v_subst_4 .cse1)) (= (bvadd (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) v_subst_4) main_~pd2~0.offset (_ bv12 32))) (_ bv4294967295 32)) v_subst_4) (bvslt (bvadd v_subst_4 (_ bv1 32)) .cse1)))) (= main_~i~0 (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) main_~i~0) main_~pd2~0.offset (_ bv8 32))))) (not (= |~#d2~0.offset| (_ bv0 32))) (not (= (bvadd (select |#valid| |~#d1~0.base|) (_ bv1 1)) (_ bv0 1)))) [2018-11-10 10:41:25,780 INFO L425 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-11-10 10:41:25,780 INFO L425 ceAbstractionStarter]: For program point L36-2(lines 36 46) no Hoare annotation was computed. [2018-11-10 10:41:25,780 INFO L421 ceAbstractionStarter]: At program point L34-1(line 34) the Hoare annotation is: (or (and (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|)) (= |~#d1~0.base| |~#d2~0.base|) (and (= main_~pd1~0.base |~#d2~0.base|) (= main_~pd1~0.offset |~#d2~0.offset|)) (not (= |~#d2~0.offset| (_ bv0 32))) (not (= (bvadd (select |#valid| |~#d1~0.base|) (_ bv1 1)) (_ bv0 1)))) [2018-11-10 10:41:25,780 INFO L425 ceAbstractionStarter]: For program point L34-2(line 34) no Hoare annotation was computed. [2018-11-10 10:41:25,780 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 31 52) the Hoare annotation is: true [2018-11-10 10:41:25,780 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 50) no Hoare annotation was computed. [2018-11-10 10:41:25,780 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 45) no Hoare annotation was computed. [2018-11-10 10:41:25,780 INFO L425 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2018-11-10 10:41:25,780 INFO L425 ceAbstractionStarter]: For program point L39-1(line 39) no Hoare annotation was computed. [2018-11-10 10:41:25,780 INFO L425 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-11-10 10:41:25,780 INFO L425 ceAbstractionStarter]: For program point L37-1(line 37) no Hoare annotation was computed. [2018-11-10 10:41:25,780 INFO L428 ceAbstractionStarter]: At program point checkENTRY(lines 26 29) the Hoare annotation is: true [2018-11-10 10:41:25,780 INFO L425 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-11-10 10:41:25,780 INFO L425 ceAbstractionStarter]: For program point L28-1(line 28) no Hoare annotation was computed. [2018-11-10 10:41:25,780 INFO L425 ceAbstractionStarter]: For program point checkFINAL(lines 26 29) no Hoare annotation was computed. [2018-11-10 10:41:25,780 INFO L425 ceAbstractionStarter]: For program point checkEXIT(lines 26 29) no Hoare annotation was computed. [2018-11-10 10:41:25,789 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-10 10:41:25,790 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-10 10:41:25,790 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-10 10:41:25,790 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-10 10:41:25,791 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 10:41:25,791 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 10:41:25,791 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 10:41:25,791 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 10:41:25,792 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 10:41:25,792 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-10 10:41:25,793 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-10 10:41:25,793 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-10 10:41:25,793 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-10 10:41:25,793 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 10:41:25,793 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 10:41:25,793 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 10:41:25,793 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 10:41:25,793 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 10:41:25,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 10:41:25 BoogieIcfgContainer [2018-11-10 10:41:25,795 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 10:41:25,795 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 10:41:25,795 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 10:41:25,795 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 10:41:25,796 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:35:53" (3/4) ... [2018-11-10 10:41:25,799 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 10:41:25,805 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure init [2018-11-10 10:41:25,805 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 10:41:25,805 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure get_dummy [2018-11-10 10:41:25,805 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 10:41:25,805 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure check [2018-11-10 10:41:25,809 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 33 nodes and edges [2018-11-10 10:41:25,809 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2018-11-10 10:41:25,809 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-10 10:41:25,810 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-10 10:41:25,810 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 10:41:25,810 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 10:41:25,843 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_b2c579f4-c1d0-4c73-aed5-d708cd01dd5d/bin-2019/uautomizer/witness.graphml [2018-11-10 10:41:25,843 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 10:41:25,843 INFO L168 Benchmark]: Toolchain (without parser) took 333238.43 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 251.7 MB). Free memory was 950.6 MB in the beginning and 958.7 MB in the end (delta: -8.2 MB). Peak memory consumption was 243.5 MB. Max. memory is 11.5 GB. [2018-11-10 10:41:25,844 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:41:25,844 INFO L168 Benchmark]: CACSL2BoogieTranslator took 197.05 ms. Allocated memory is still 1.0 GB. Free memory was 950.6 MB in the beginning and 934.4 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-10 10:41:25,844 INFO L168 Benchmark]: Boogie Preprocessor took 27.84 ms. Allocated memory is still 1.0 GB. Free memory is still 934.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:41:25,844 INFO L168 Benchmark]: RCFGBuilder took 368.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 174.1 MB). Free memory was 934.4 MB in the beginning and 1.1 GB in the end (delta: -205.1 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. [2018-11-10 10:41:25,845 INFO L168 Benchmark]: TraceAbstraction took 332594.06 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 77.6 MB). Free memory was 1.1 GB in the beginning and 966.8 MB in the end (delta: 172.7 MB). Peak memory consumption was 378.1 MB. Max. memory is 11.5 GB. [2018-11-10 10:41:25,845 INFO L168 Benchmark]: Witness Printer took 47.84 ms. Allocated memory is still 1.3 GB. Free memory was 966.8 MB in the beginning and 958.7 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. [2018-11-10 10:41:25,846 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 197.05 ms. Allocated memory is still 1.0 GB. Free memory was 950.6 MB in the beginning and 934.4 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.84 ms. Allocated memory is still 1.0 GB. Free memory is still 934.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 368.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 174.1 MB). Free memory was 934.4 MB in the beginning and 1.1 GB in the end (delta: -205.1 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 332594.06 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 77.6 MB). Free memory was 1.1 GB in the beginning and 966.8 MB in the end (delta: 172.7 MB). Peak memory consumption was 378.1 MB. Max. memory is 11.5 GB. * Witness Printer took 47.84 ms. Allocated memory is still 1.3 GB. Free memory was 966.8 MB in the beginning and 958.7 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] * 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 - 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 - 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: 50]: 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: 32]: Loop Invariant Derived loop invariant: (d1 == d2 || !(d2 == 0bv32)) || !(~bvadd64(\valid[d1], 1bv1) == 0bv1) - InvariantResult [Line: 40]: Loop Invariant [2018-11-10 10:41:25,849 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-10 10:41:25,849 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-10 10:41:25,849 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-10 10:41:25,849 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-10 10:41:25,850 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 10:41:25,850 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 10:41:25,850 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 10:41:25,850 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 10:41:25,850 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 10:41:25,851 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-10 10:41:25,851 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-10 10:41:25,851 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-10 10:41:25,851 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-10 10:41:25,851 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 10:41:25,852 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 10:41:25,852 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 10:41:25,852 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 10:41:25,852 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((((forall main_~i~0 : bv32 :: (~bvslt32(~bvadd64(main_~i~0, 1bv32), unknown-#memory_int-unknown[pa][pa]) || ~bvadd64(unknown-#memory_int-unknown[pd2][~bvadd64(~bvmul32(4bv32, main_~i~0), pd2, 12bv32)], 4294967295bv32) == main_~i~0) || !~bvslt32(main_~i~0, unknown-#memory_int-unknown[pa][pa])) && (~bvslt32(i, unknown-#memory_int-unknown[pa][pa]) || i == unknown-#memory_int-unknown[pd2][~bvadd64(~bvmul32(4bv32, i), pd2, 8bv32)])) && pd2 == pd1 && pd1 == pd2) || !(~bvadd64(\valid[d1], 1bv1) == 0bv1)) || d1 == d2) || !(d2 == 0bv32) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 84 locations, 1 error locations. SAFE Result, 332.5s OverallTime, 10 OverallIterations, 11 TraceHistogramMax, 280.1s AutomataDifference, 0.0s DeadEndRemovalTime, 12.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 638 SDtfs, 931 SDslu, 5526 SDs, 0 SdLazy, 7091 SolverSat, 430 SolverUnsat, 42 SolverUnknown, 0 SolverNotchecked, 99.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1780 GetRequests, 1384 SyntacticMatches, 4 SemanticMatches, 392 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4949 ImplicationChecksByTransitivity, 213.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=144occurred 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.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 166 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 24 PreInvPairs, 61 NumberOfFragments, 247 HoareAnnotationTreeSize, 24 FomulaSimplifications, 99782 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 12 FomulaSimplificationsInter, 35547 FormulaSimplificationTreeSizeReductionInter, 11.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 38.6s InterpolantComputationTime, 917 NumberOfCodeBlocks, 890 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1573 ConstructedInterpolants, 107 QuantifiedInterpolants, 1020052 SizeOfPredicates, 106 NumberOfNonLiveVariables, 1514 ConjunctsInSsa, 231 ConjunctsInUnsatCore, 17 InterpolantComputations, 3 PerfectInterpolantSequences, 503/884 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...