./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-numeric/recHanoi02-1.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_3d918adf-83f6-447d-aaa7-628b5b410558/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_3d918adf-83f6-447d-aaa7-628b5b410558/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3d918adf-83f6-447d-aaa7-628b5b410558/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3d918adf-83f6-447d-aaa7-628b5b410558/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/termination-numeric/recHanoi02-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_3d918adf-83f6-447d-aaa7-628b5b410558/bin/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3d918adf-83f6-447d-aaa7-628b5b410558/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 5562cc301d5faa8ad8777fb25a4973bec89fa1c5 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/run_dir_3d918adf-83f6-447d-aaa7-628b5b410558/bin/uautomizer/config using search string *Overflow*64bit*_Bitvector*.epf No suitable settings file found using Overflow*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@40b2f1d4 --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 17:04:57,244 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:04:57,246 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:04:57,255 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:04:57,255 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:04:57,255 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:04:57,256 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:04:57,258 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:04:57,259 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:04:57,260 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:04:57,261 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:04:57,262 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:04:57,262 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:04:57,262 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:04:57,263 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:04:57,264 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:04:57,264 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:04:57,265 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:04:57,266 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:04:57,268 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:04:57,269 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:04:57,270 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:04:57,271 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:04:57,271 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:04:57,273 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:04:57,274 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:04:57,274 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:04:57,274 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:04:57,274 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:04:57,275 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:04:57,275 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:04:57,276 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:04:57,276 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:04:57,277 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:04:57,278 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:04:57,278 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:04:57,279 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:04:57,279 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:04:57,279 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:04:57,280 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:04:57,280 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:04:57,280 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3d918adf-83f6-447d-aaa7-628b5b410558/bin/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-12-07 17:04:57,290 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:04:57,290 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:04:57,290 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:04:57,291 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:04:57,291 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:04:57,291 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:04:57,291 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 17:04:57,291 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:04:57,291 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:04:57,291 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 17:04:57,291 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:04:57,292 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 17:04:57,292 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-12-07 17:04:57,292 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:04:57,292 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:04:57,292 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 17:04:57,292 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:04:57,292 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:04:57,293 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:04:57,293 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:04:57,293 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:04:57,293 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:04:57,293 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:04:57,293 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 17:04:57,293 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:04:57,293 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:04:57,293 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 17:04:57,294 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:04:57,294 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/run_dir_3d918adf-83f6-447d-aaa7-628b5b410558/bin/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 ! overflow) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5562cc301d5faa8ad8777fb25a4973bec89fa1c5 [2019-12-07 17:04:57,391 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:04:57,398 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:04:57,401 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:04:57,401 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:04:57,402 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:04:57,402 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3d918adf-83f6-447d-aaa7-628b5b410558/bin/uautomizer/../../sv-benchmarks/c/termination-numeric/recHanoi02-1.c [2019-12-07 17:04:57,439 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3d918adf-83f6-447d-aaa7-628b5b410558/bin/uautomizer/data/7973f89f4/33b07a269ad64f64a3e184ddd52e9b76/FLAG68b1bf452 [2019-12-07 17:04:57,851 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:04:57,851 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3d918adf-83f6-447d-aaa7-628b5b410558/sv-benchmarks/c/termination-numeric/recHanoi02-1.c [2019-12-07 17:04:57,855 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3d918adf-83f6-447d-aaa7-628b5b410558/bin/uautomizer/data/7973f89f4/33b07a269ad64f64a3e184ddd52e9b76/FLAG68b1bf452 [2019-12-07 17:04:57,864 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3d918adf-83f6-447d-aaa7-628b5b410558/bin/uautomizer/data/7973f89f4/33b07a269ad64f64a3e184ddd52e9b76 [2019-12-07 17:04:57,865 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:04:57,866 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:04:57,867 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:04:57,867 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:04:57,869 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:04:57,870 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:04:57" (1/1) ... [2019-12-07 17:04:57,871 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@174ba895 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:04:57, skipping insertion in model container [2019-12-07 17:04:57,871 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:04:57" (1/1) ... [2019-12-07 17:04:57,876 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:04:57,886 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:04:57,981 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:04:57,983 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:04:58,028 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:04:58,037 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:04:58,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:04:58 WrapperNode [2019-12-07 17:04:58,038 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:04:58,039 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:04:58,039 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:04:58,039 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:04:58,044 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:04:58" (1/1) ... [2019-12-07 17:04:58,048 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:04:58" (1/1) ... [2019-12-07 17:04:58,059 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:04:58,059 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:04:58,059 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:04:58,059 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:04:58,065 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:04:58" (1/1) ... [2019-12-07 17:04:58,065 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:04:58" (1/1) ... [2019-12-07 17:04:58,066 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:04:58" (1/1) ... [2019-12-07 17:04:58,066 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:04:58" (1/1) ... [2019-12-07 17:04:58,067 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:04:58" (1/1) ... [2019-12-07 17:04:58,069 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:04:58" (1/1) ... [2019-12-07 17:04:58,069 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:04:58" (1/1) ... [2019-12-07 17:04:58,070 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:04:58,071 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:04:58,071 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:04:58,071 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:04:58,071 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:04:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3d918adf-83f6-447d-aaa7-628b5b410558/bin/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 [2019-12-07 17:04:58,110 INFO L130 BoogieDeclarations]: Found specification of procedure hanoi [2019-12-07 17:04:58,110 INFO L138 BoogieDeclarations]: Found implementation of procedure hanoi [2019-12-07 17:04:58,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:04:58,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:04:58,215 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:04:58,215 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-12-07 17:04:58,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:04:58 BoogieIcfgContainer [2019-12-07 17:04:58,216 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:04:58,216 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:04:58,216 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:04:58,219 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:04:58,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:04:57" (1/3) ... [2019-12-07 17:04:58,220 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17d018a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:04:58, skipping insertion in model container [2019-12-07 17:04:58,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:04:58" (2/3) ... [2019-12-07 17:04:58,220 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17d018a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:04:58, skipping insertion in model container [2019-12-07 17:04:58,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:04:58" (3/3) ... [2019-12-07 17:04:58,221 INFO L109 eAbstractionObserver]: Analyzing ICFG recHanoi02-1.c [2019-12-07 17:04:58,228 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:04:58,232 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-12-07 17:04:58,239 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 17:04:58,257 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:04:58,258 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 17:04:58,258 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:04:58,258 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:04:58,258 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:04:58,258 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:04:58,258 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:04:58,258 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:04:58,269 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-12-07 17:04:58,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 17:04:58,273 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:04:58,273 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 17:04:58,274 INFO L410 AbstractCegarLoop]: === Iteration 1 === [hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 17:04:58,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:04:58,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1513948958, now seen corresponding path program 1 times [2019-12-07 17:04:58,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:04:58,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472602835] [2019-12-07 17:04:58,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:04:58,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:04:58,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:04:58,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472602835] [2019-12-07 17:04:58,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:04:58,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:04:58,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546147050] [2019-12-07 17:04:58,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:04:58,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:04:58,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:04:58,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:04:58,410 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 5 states. [2019-12-07 17:04:58,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:04:58,461 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2019-12-07 17:04:58,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:04:58,462 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-12-07 17:04:58,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:04:58,468 INFO L225 Difference]: With dead ends: 33 [2019-12-07 17:04:58,468 INFO L226 Difference]: Without dead ends: 20 [2019-12-07 17:04:58,470 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:04:58,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-12-07 17:04:58,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-12-07 17:04:58,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-12-07 17:04:58,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-12-07 17:04:58,495 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 6 [2019-12-07 17:04:58,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:04:58,495 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-12-07 17:04:58,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:04:58,495 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-12-07 17:04:58,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 17:04:58,496 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:04:58,496 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:04:58,496 INFO L410 AbstractCegarLoop]: === Iteration 2 === [hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 17:04:58,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:04:58,496 INFO L82 PathProgramCache]: Analyzing trace with hash -312222520, now seen corresponding path program 1 times [2019-12-07 17:04:58,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:04:58,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215100519] [2019-12-07 17:04:58,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:04:58,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:04:58,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:04:58,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215100519] [2019-12-07 17:04:58,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:04:58,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:04:58,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611055602] [2019-12-07 17:04:58,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:04:58,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:04:58,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:04:58,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:04:58,523 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 5 states. [2019-12-07 17:04:58,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:04:58,558 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2019-12-07 17:04:58,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:04:58,558 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-12-07 17:04:58,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:04:58,560 INFO L225 Difference]: With dead ends: 39 [2019-12-07 17:04:58,560 INFO L226 Difference]: Without dead ends: 36 [2019-12-07 17:04:58,561 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:04:58,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-12-07 17:04:58,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2019-12-07 17:04:58,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-12-07 17:04:58,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2019-12-07 17:04:58,568 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 7 [2019-12-07 17:04:58,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:04:58,568 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2019-12-07 17:04:58,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:04:58,568 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2019-12-07 17:04:58,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 17:04:58,569 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:04:58,569 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-12-07 17:04:58,569 INFO L410 AbstractCegarLoop]: === Iteration 3 === [hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 17:04:58,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:04:58,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1144431293, now seen corresponding path program 1 times [2019-12-07 17:04:58,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:04:58,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826784364] [2019-12-07 17:04:58,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:04:58,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:04:58,608 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:04:58,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826784364] [2019-12-07 17:04:58,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621306696] [2019-12-07 17:04:58,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3d918adf-83f6-447d-aaa7-628b5b410558/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:04:58,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:04:58,630 INFO L264 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 17:04:58,634 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:04:58,651 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:04:58,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:04:58,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-12-07 17:04:58,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070383234] [2019-12-07 17:04:58,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:04:58,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:04:58,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:04:58,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:04:58,653 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 7 states. [2019-12-07 17:04:58,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:04:58,708 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2019-12-07 17:04:58,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 17:04:58,708 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-12-07 17:04:58,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:04:58,709 INFO L225 Difference]: With dead ends: 55 [2019-12-07 17:04:58,709 INFO L226 Difference]: Without dead ends: 54 [2019-12-07 17:04:58,710 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:04:58,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-12-07 17:04:58,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 42. [2019-12-07 17:04:58,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-12-07 17:04:58,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2019-12-07 17:04:58,717 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 12 [2019-12-07 17:04:58,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:04:58,717 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2019-12-07 17:04:58,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:04:58,717 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2019-12-07 17:04:58,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 17:04:58,717 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:04:58,718 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:04:58,918 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:04:58,919 INFO L410 AbstractCegarLoop]: === Iteration 4 === [hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 17:04:58,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:04:58,919 INFO L82 PathProgramCache]: Analyzing trace with hash -287349001, now seen corresponding path program 1 times [2019-12-07 17:04:58,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:04:58,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990137980] [2019-12-07 17:04:58,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:04:58,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:04:58,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:04:58,966 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 17:04:58,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990137980] [2019-12-07 17:04:58,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:04:58,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:04:58,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589082184] [2019-12-07 17:04:58,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:04:58,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:04:58,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:04:58,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:04:58,968 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand 4 states. [2019-12-07 17:04:58,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:04:58,987 INFO L93 Difference]: Finished difference Result 65 states and 83 transitions. [2019-12-07 17:04:58,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:04:58,987 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 17:04:58,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:04:58,988 INFO L225 Difference]: With dead ends: 65 [2019-12-07 17:04:58,988 INFO L226 Difference]: Without dead ends: 54 [2019-12-07 17:04:58,989 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:04:58,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-12-07 17:04:58,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-12-07 17:04:58,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-12-07 17:04:58,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2019-12-07 17:04:58,995 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 14 [2019-12-07 17:04:58,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:04:58,996 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2019-12-07 17:04:58,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:04:58,996 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2019-12-07 17:04:58,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 17:04:58,996 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:04:58,996 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1] [2019-12-07 17:04:58,996 INFO L410 AbstractCegarLoop]: === Iteration 5 === [hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 17:04:58,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:04:58,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1656222120, now seen corresponding path program 2 times [2019-12-07 17:04:58,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:04:58,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11241052] [2019-12-07 17:04:58,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:04:59,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:04:59,039 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:04:59,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11241052] [2019-12-07 17:04:59,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105993888] [2019-12-07 17:04:59,040 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3d918adf-83f6-447d-aaa7-628b5b410558/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:04:59,058 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 17:04:59,058 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:04:59,058 INFO L264 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 17:04:59,059 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:04:59,065 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:04:59,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:04:59,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-12-07 17:04:59,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927753341] [2019-12-07 17:04:59,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 17:04:59,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:04:59,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 17:04:59,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:04:59,067 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand 9 states. [2019-12-07 17:04:59,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:04:59,141 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2019-12-07 17:04:59,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 17:04:59,141 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2019-12-07 17:04:59,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:04:59,143 INFO L225 Difference]: With dead ends: 86 [2019-12-07 17:04:59,143 INFO L226 Difference]: Without dead ends: 85 [2019-12-07 17:04:59,143 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-12-07 17:04:59,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-12-07 17:04:59,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 73. [2019-12-07 17:04:59,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-12-07 17:04:59,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 88 transitions. [2019-12-07 17:04:59,154 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 88 transitions. Word has length 17 [2019-12-07 17:04:59,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:04:59,155 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 88 transitions. [2019-12-07 17:04:59,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 17:04:59,155 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 88 transitions. [2019-12-07 17:04:59,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 17:04:59,156 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:04:59,156 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1] [2019-12-07 17:04:59,356 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:04:59,356 INFO L410 AbstractCegarLoop]: === Iteration 6 === [hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 17:04:59,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:04:59,357 INFO L82 PathProgramCache]: Analyzing trace with hash 438260835, now seen corresponding path program 3 times [2019-12-07 17:04:59,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:04:59,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755393627] [2019-12-07 17:04:59,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:04:59,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:04:59,434 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:04:59,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755393627] [2019-12-07 17:04:59,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337769573] [2019-12-07 17:04:59,434 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3d918adf-83f6-447d-aaa7-628b5b410558/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:04:59,451 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-07 17:04:59,451 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:04:59,452 INFO L264 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 17:04:59,453 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:04:59,459 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:04:59,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:04:59,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-12-07 17:04:59,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583592505] [2019-12-07 17:04:59,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 17:04:59,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:04:59,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 17:04:59,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:04:59,460 INFO L87 Difference]: Start difference. First operand 73 states and 88 transitions. Second operand 11 states. [2019-12-07 17:04:59,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:04:59,563 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2019-12-07 17:04:59,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 17:04:59,563 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2019-12-07 17:04:59,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:04:59,564 INFO L225 Difference]: With dead ends: 109 [2019-12-07 17:04:59,564 INFO L226 Difference]: Without dead ends: 108 [2019-12-07 17:04:59,565 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2019-12-07 17:04:59,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-12-07 17:04:59,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 92. [2019-12-07 17:04:59,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-12-07 17:04:59,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 112 transitions. [2019-12-07 17:04:59,574 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 112 transitions. Word has length 22 [2019-12-07 17:04:59,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:04:59,574 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 112 transitions. [2019-12-07 17:04:59,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 17:04:59,574 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 112 transitions. [2019-12-07 17:04:59,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 17:04:59,575 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:04:59,575 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1] [2019-12-07 17:04:59,776 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:04:59,776 INFO L410 AbstractCegarLoop]: === Iteration 7 === [hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 17:04:59,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:04:59,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1696558728, now seen corresponding path program 4 times [2019-12-07 17:04:59,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:04:59,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882449594] [2019-12-07 17:04:59,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:04:59,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:04:59,878 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:04:59,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882449594] [2019-12-07 17:04:59,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198527947] [2019-12-07 17:04:59,879 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3d918adf-83f6-447d-aaa7-628b5b410558/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:04:59,898 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 17:04:59,898 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:04:59,898 INFO L264 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 17:04:59,900 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:04:59,906 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:04:59,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:04:59,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2019-12-07 17:04:59,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764519759] [2019-12-07 17:04:59,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 17:04:59,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:04:59,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 17:04:59,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-12-07 17:04:59,908 INFO L87 Difference]: Start difference. First operand 92 states and 112 transitions. Second operand 13 states. [2019-12-07 17:05:00,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:05:00,026 INFO L93 Difference]: Finished difference Result 132 states and 137 transitions. [2019-12-07 17:05:00,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 17:05:00,027 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2019-12-07 17:05:00,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:05:00,029 INFO L225 Difference]: With dead ends: 132 [2019-12-07 17:05:00,029 INFO L226 Difference]: Without dead ends: 131 [2019-12-07 17:05:00,029 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=132, Invalid=288, Unknown=0, NotChecked=0, Total=420 [2019-12-07 17:05:00,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-12-07 17:05:00,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 111. [2019-12-07 17:05:00,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-12-07 17:05:00,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 136 transitions. [2019-12-07 17:05:00,039 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 136 transitions. Word has length 27 [2019-12-07 17:05:00,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:05:00,039 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 136 transitions. [2019-12-07 17:05:00,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 17:05:00,040 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 136 transitions. [2019-12-07 17:05:00,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 17:05:00,040 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:05:00,040 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:05:00,241 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:05:00,241 INFO L410 AbstractCegarLoop]: === Iteration 8 === [hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 17:05:00,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:05:00,242 INFO L82 PathProgramCache]: Analyzing trace with hash -563967927, now seen corresponding path program 1 times [2019-12-07 17:05:00,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:05:00,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216129679] [2019-12-07 17:05:00,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:05:00,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:00,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:00,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:00,308 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 17:05:00,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216129679] [2019-12-07 17:05:00,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764561070] [2019-12-07 17:05:00,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3d918adf-83f6-447d-aaa7-628b5b410558/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:05:00,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:00,326 INFO L264 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 17:05:00,327 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:05:00,343 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 17:05:00,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:05:00,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-12-07 17:05:00,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879681119] [2019-12-07 17:05:00,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 17:05:00,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:05:00,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 17:05:00,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:05:00,345 INFO L87 Difference]: Start difference. First operand 111 states and 136 transitions. Second operand 8 states. [2019-12-07 17:05:00,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:05:00,371 INFO L93 Difference]: Finished difference Result 153 states and 200 transitions. [2019-12-07 17:05:00,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:05:00,372 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2019-12-07 17:05:00,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:05:00,373 INFO L225 Difference]: With dead ends: 153 [2019-12-07 17:05:00,374 INFO L226 Difference]: Without dead ends: 151 [2019-12-07 17:05:00,374 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:05:00,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-12-07 17:05:00,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 145. [2019-12-07 17:05:00,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-12-07 17:05:00,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 177 transitions. [2019-12-07 17:05:00,383 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 177 transitions. Word has length 26 [2019-12-07 17:05:00,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:05:00,383 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 177 transitions. [2019-12-07 17:05:00,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 17:05:00,384 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 177 transitions. [2019-12-07 17:05:00,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 17:05:00,384 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:05:00,385 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:05:00,585 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:05:00,586 INFO L410 AbstractCegarLoop]: === Iteration 9 === [hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 17:05:00,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:05:00,586 INFO L82 PathProgramCache]: Analyzing trace with hash -303136509, now seen corresponding path program 1 times [2019-12-07 17:05:00,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:05:00,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853728825] [2019-12-07 17:05:00,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:05:00,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:00,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:00,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:00,638 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 17:05:00,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853728825] [2019-12-07 17:05:00,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943741931] [2019-12-07 17:05:00,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3d918adf-83f6-447d-aaa7-628b5b410558/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:05:00,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:00,657 INFO L264 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 17:05:00,658 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:05:00,673 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 17:05:00,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:05:00,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2019-12-07 17:05:00,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671198767] [2019-12-07 17:05:00,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:05:00,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:05:00,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:05:00,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:05:00,674 INFO L87 Difference]: Start difference. First operand 145 states and 177 transitions. Second operand 6 states. [2019-12-07 17:05:00,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:05:00,691 INFO L93 Difference]: Finished difference Result 145 states and 177 transitions. [2019-12-07 17:05:00,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:05:00,692 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-07 17:05:00,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:05:00,693 INFO L225 Difference]: With dead ends: 145 [2019-12-07 17:05:00,693 INFO L226 Difference]: Without dead ends: 129 [2019-12-07 17:05:00,693 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:05:00,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-12-07 17:05:00,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2019-12-07 17:05:00,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-12-07 17:05:00,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 144 transitions. [2019-12-07 17:05:00,699 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 144 transitions. Word has length 27 [2019-12-07 17:05:00,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:05:00,699 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 144 transitions. [2019-12-07 17:05:00,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:05:00,700 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 144 transitions. [2019-12-07 17:05:00,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 17:05:00,700 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:05:00,700 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1, 1, 1] [2019-12-07 17:05:00,901 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:05:00,901 INFO L410 AbstractCegarLoop]: === Iteration 10 === [hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 17:05:00,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:05:00,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1757224061, now seen corresponding path program 5 times [2019-12-07 17:05:00,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:05:00,902 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886011529] [2019-12-07 17:05:00,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:05:00,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:01,004 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:05:01,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886011529] [2019-12-07 17:05:01,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100272584] [2019-12-07 17:05:01,004 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3d918adf-83f6-447d-aaa7-628b5b410558/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:05:01,023 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-12-07 17:05:01,023 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:05:01,024 INFO L264 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 17:05:01,025 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:05:01,032 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:05:01,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:05:01,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2019-12-07 17:05:01,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808706008] [2019-12-07 17:05:01,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 17:05:01,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:05:01,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 17:05:01,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2019-12-07 17:05:01,034 INFO L87 Difference]: Start difference. First operand 129 states and 144 transitions. Second operand 15 states. [2019-12-07 17:05:01,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:05:01,161 INFO L93 Difference]: Finished difference Result 167 states and 173 transitions. [2019-12-07 17:05:01,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 17:05:01,161 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 32 [2019-12-07 17:05:01,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:05:01,162 INFO L225 Difference]: With dead ends: 167 [2019-12-07 17:05:01,163 INFO L226 Difference]: Without dead ends: 166 [2019-12-07 17:05:01,163 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=168, Invalid=384, Unknown=0, NotChecked=0, Total=552 [2019-12-07 17:05:01,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-12-07 17:05:01,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 154. [2019-12-07 17:05:01,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-12-07 17:05:01,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 172 transitions. [2019-12-07 17:05:01,171 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 172 transitions. Word has length 32 [2019-12-07 17:05:01,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:05:01,171 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 172 transitions. [2019-12-07 17:05:01,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 17:05:01,171 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 172 transitions. [2019-12-07 17:05:01,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 17:05:01,172 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:05:01,173 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1, 1, 1] [2019-12-07 17:05:01,373 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:05:01,373 INFO L410 AbstractCegarLoop]: === Iteration 11 === [hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 17:05:01,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:05:01,374 INFO L82 PathProgramCache]: Analyzing trace with hash -512208024, now seen corresponding path program 6 times [2019-12-07 17:05:01,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:05:01,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379233675] [2019-12-07 17:05:01,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:05:01,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:01,476 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:05:01,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379233675] [2019-12-07 17:05:01,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019526602] [2019-12-07 17:05:01,476 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3d918adf-83f6-447d-aaa7-628b5b410558/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:05:01,500 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-12-07 17:05:01,500 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:05:01,501 INFO L264 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-07 17:05:01,502 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:05:01,532 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-12-07 17:05:01,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:05:01,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 17 [2019-12-07 17:05:01,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329337629] [2019-12-07 17:05:01,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 17:05:01,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:05:01,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 17:05:01,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2019-12-07 17:05:01,534 INFO L87 Difference]: Start difference. First operand 154 states and 172 transitions. Second operand 18 states. [2019-12-07 17:05:01,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:05:01,564 INFO L93 Difference]: Finished difference Result 154 states and 172 transitions. [2019-12-07 17:05:01,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:05:01,565 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 37 [2019-12-07 17:05:01,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:05:01,566 INFO L225 Difference]: With dead ends: 154 [2019-12-07 17:05:01,566 INFO L226 Difference]: Without dead ends: 153 [2019-12-07 17:05:01,566 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2019-12-07 17:05:01,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-12-07 17:05:01,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2019-12-07 17:05:01,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-12-07 17:05:01,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 171 transitions. [2019-12-07 17:05:01,574 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 171 transitions. Word has length 37 [2019-12-07 17:05:01,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:05:01,574 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 171 transitions. [2019-12-07 17:05:01,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 17:05:01,574 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 171 transitions. [2019-12-07 17:05:01,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 17:05:01,575 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:05:01,576 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-12-07 17:05:01,776 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:05:01,777 INFO L410 AbstractCegarLoop]: === Iteration 12 === [hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 17:05:01,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:05:01,777 INFO L82 PathProgramCache]: Analyzing trace with hash 867149367, now seen corresponding path program 2 times [2019-12-07 17:05:01,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:05:01,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745360472] [2019-12-07 17:05:01,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:05:01,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:01,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:01,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:01,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:01,891 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-12-07 17:05:01,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745360472] [2019-12-07 17:05:01,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372314599] [2019-12-07 17:05:01,892 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3d918adf-83f6-447d-aaa7-628b5b410558/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:05:01,922 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 17:05:01,923 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:05:01,923 INFO L264 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 17:05:01,925 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:05:01,947 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-12-07 17:05:01,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:05:01,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-07 17:05:01,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624447259] [2019-12-07 17:05:01,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 17:05:01,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:05:01,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 17:05:01,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:05:01,948 INFO L87 Difference]: Start difference. First operand 153 states and 171 transitions. Second operand 10 states. [2019-12-07 17:05:01,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:05:01,973 INFO L93 Difference]: Finished difference Result 207 states and 237 transitions. [2019-12-07 17:05:01,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 17:05:01,973 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2019-12-07 17:05:01,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:05:01,974 INFO L225 Difference]: With dead ends: 207 [2019-12-07 17:05:01,974 INFO L226 Difference]: Without dead ends: 185 [2019-12-07 17:05:01,975 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:05:01,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-12-07 17:05:01,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 179. [2019-12-07 17:05:01,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-12-07 17:05:01,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 197 transitions. [2019-12-07 17:05:01,981 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 197 transitions. Word has length 38 [2019-12-07 17:05:01,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:05:01,981 INFO L462 AbstractCegarLoop]: Abstraction has 179 states and 197 transitions. [2019-12-07 17:05:01,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 17:05:01,981 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 197 transitions. [2019-12-07 17:05:01,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 17:05:01,982 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:05:01,982 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2019-12-07 17:05:02,182 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:05:02,183 INFO L410 AbstractCegarLoop]: === Iteration 13 === [hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 17:05:02,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:05:02,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1066180599, now seen corresponding path program 3 times [2019-12-07 17:05:02,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:05:02,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247826749] [2019-12-07 17:05:02,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:05:02,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:02,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:02,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:02,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:02,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:02,335 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-12-07 17:05:02,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247826749] [2019-12-07 17:05:02,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066199216] [2019-12-07 17:05:02,336 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3d918adf-83f6-447d-aaa7-628b5b410558/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:05:02,357 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-07 17:05:02,357 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:05:02,358 INFO L264 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 17:05:02,359 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:05:02,390 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-12-07 17:05:02,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:05:02,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2019-12-07 17:05:02,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84384668] [2019-12-07 17:05:02,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 17:05:02,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:05:02,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 17:05:02,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:05:02,391 INFO L87 Difference]: Start difference. First operand 179 states and 197 transitions. Second operand 12 states. [2019-12-07 17:05:02,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:05:02,422 INFO L93 Difference]: Finished difference Result 233 states and 263 transitions. [2019-12-07 17:05:02,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 17:05:02,422 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 50 [2019-12-07 17:05:02,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:05:02,423 INFO L225 Difference]: With dead ends: 233 [2019-12-07 17:05:02,423 INFO L226 Difference]: Without dead ends: 204 [2019-12-07 17:05:02,424 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:05:02,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-12-07 17:05:02,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 198. [2019-12-07 17:05:02,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-12-07 17:05:02,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 216 transitions. [2019-12-07 17:05:02,430 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 216 transitions. Word has length 50 [2019-12-07 17:05:02,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:05:02,430 INFO L462 AbstractCegarLoop]: Abstraction has 198 states and 216 transitions. [2019-12-07 17:05:02,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 17:05:02,430 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 216 transitions. [2019-12-07 17:05:02,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 17:05:02,431 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:05:02,431 INFO L410 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2019-12-07 17:05:02,631 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:05:02,632 INFO L410 AbstractCegarLoop]: === Iteration 14 === [hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 17:05:02,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:05:02,632 INFO L82 PathProgramCache]: Analyzing trace with hash -158018185, now seen corresponding path program 4 times [2019-12-07 17:05:02,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:05:02,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443722898] [2019-12-07 17:05:02,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:05:02,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:02,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:02,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:02,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:02,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:02,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:02,814 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-12-07 17:05:02,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443722898] [2019-12-07 17:05:02,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551964114] [2019-12-07 17:05:02,815 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3d918adf-83f6-447d-aaa7-628b5b410558/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:05:02,838 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 17:05:02,838 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:05:02,838 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 17:05:02,841 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:05:02,888 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-12-07 17:05:02,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:05:02,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2019-12-07 17:05:02,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245173806] [2019-12-07 17:05:02,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 17:05:02,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:05:02,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 17:05:02,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-12-07 17:05:02,890 INFO L87 Difference]: Start difference. First operand 198 states and 216 transitions. Second operand 14 states. [2019-12-07 17:05:02,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:05:02,931 INFO L93 Difference]: Finished difference Result 252 states and 282 transitions. [2019-12-07 17:05:02,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 17:05:02,932 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 62 [2019-12-07 17:05:02,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:05:02,933 INFO L225 Difference]: With dead ends: 252 [2019-12-07 17:05:02,933 INFO L226 Difference]: Without dead ends: 216 [2019-12-07 17:05:02,933 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 66 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-12-07 17:05:02,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-12-07 17:05:02,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 210. [2019-12-07 17:05:02,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-12-07 17:05:02,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 228 transitions. [2019-12-07 17:05:02,941 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 228 transitions. Word has length 62 [2019-12-07 17:05:02,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:05:02,941 INFO L462 AbstractCegarLoop]: Abstraction has 210 states and 228 transitions. [2019-12-07 17:05:02,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 17:05:02,941 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 228 transitions. [2019-12-07 17:05:02,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-07 17:05:02,942 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:05:02,942 INFO L410 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1] [2019-12-07 17:05:03,142 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:05:03,143 INFO L410 AbstractCegarLoop]: === Iteration 15 === [hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 17:05:03,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:05:03,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1955313719, now seen corresponding path program 5 times [2019-12-07 17:05:03,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:05:03,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332442532] [2019-12-07 17:05:03,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:05:03,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:03,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:03,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:03,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:03,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:03,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:03,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:03,260 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-12-07 17:05:03,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332442532] [2019-12-07 17:05:03,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377453854] [2019-12-07 17:05:03,260 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3d918adf-83f6-447d-aaa7-628b5b410558/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:05:03,285 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-12-07 17:05:03,285 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:05:03,285 INFO L264 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 17:05:03,287 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:05:03,335 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-12-07 17:05:03,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:05:03,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 15 [2019-12-07 17:05:03,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040627019] [2019-12-07 17:05:03,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 17:05:03,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:05:03,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 17:05:03,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-12-07 17:05:03,336 INFO L87 Difference]: Start difference. First operand 210 states and 228 transitions. Second operand 16 states. [2019-12-07 17:05:03,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:05:03,374 INFO L93 Difference]: Finished difference Result 264 states and 294 transitions. [2019-12-07 17:05:03,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 17:05:03,375 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 74 [2019-12-07 17:05:03,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:05:03,376 INFO L225 Difference]: With dead ends: 264 [2019-12-07 17:05:03,376 INFO L226 Difference]: Without dead ends: 223 [2019-12-07 17:05:03,377 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 79 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-12-07 17:05:03,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-12-07 17:05:03,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 217. [2019-12-07 17:05:03,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-12-07 17:05:03,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 235 transitions. [2019-12-07 17:05:03,385 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 235 transitions. Word has length 74 [2019-12-07 17:05:03,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:05:03,385 INFO L462 AbstractCegarLoop]: Abstraction has 217 states and 235 transitions. [2019-12-07 17:05:03,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 17:05:03,386 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 235 transitions. [2019-12-07 17:05:03,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-07 17:05:03,387 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:05:03,387 INFO L410 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1] [2019-12-07 17:05:03,588 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:05:03,588 INFO L410 AbstractCegarLoop]: === Iteration 16 === [hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 17:05:03,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:05:03,589 INFO L82 PathProgramCache]: Analyzing trace with hash -330632009, now seen corresponding path program 6 times [2019-12-07 17:05:03,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:05:03,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647349827] [2019-12-07 17:05:03,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:05:03,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:03,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:03,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:03,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:03,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:03,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:03,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:03,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:03,800 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 129 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-12-07 17:05:03,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647349827] [2019-12-07 17:05:03,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879500829] [2019-12-07 17:05:03,800 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3d918adf-83f6-447d-aaa7-628b5b410558/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:05:03,830 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-12-07 17:05:03,830 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:05:03,831 INFO L264 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-07 17:05:03,832 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:05:03,899 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 129 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-12-07 17:05:03,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:05:03,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 17 [2019-12-07 17:05:03,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262930197] [2019-12-07 17:05:03,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 17:05:03,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:05:03,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 17:05:03,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2019-12-07 17:05:03,900 INFO L87 Difference]: Start difference. First operand 217 states and 235 transitions. Second operand 18 states. [2019-12-07 17:05:03,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:05:03,946 INFO L93 Difference]: Finished difference Result 271 states and 301 transitions. [2019-12-07 17:05:03,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 17:05:03,946 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 86 [2019-12-07 17:05:03,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:05:03,947 INFO L225 Difference]: With dead ends: 271 [2019-12-07 17:05:03,947 INFO L226 Difference]: Without dead ends: 230 [2019-12-07 17:05:03,948 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 92 SyntacticMatches, 6 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2019-12-07 17:05:03,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-12-07 17:05:03,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 224. [2019-12-07 17:05:03,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-12-07 17:05:03,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 242 transitions. [2019-12-07 17:05:03,957 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 242 transitions. Word has length 86 [2019-12-07 17:05:03,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:05:03,958 INFO L462 AbstractCegarLoop]: Abstraction has 224 states and 242 transitions. [2019-12-07 17:05:03,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 17:05:03,958 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 242 transitions. [2019-12-07 17:05:03,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-12-07 17:05:03,960 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:05:03,960 INFO L410 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1] [2019-12-07 17:05:04,160 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:05:04,161 INFO L410 AbstractCegarLoop]: === Iteration 17 === [hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 17:05:04,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:05:04,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1066952498, now seen corresponding path program 7 times [2019-12-07 17:05:04,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:05:04,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828539060] [2019-12-07 17:05:04,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:05:04,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:04,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:04,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:04,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:04,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:04,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:04,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:04,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:04,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:04,375 INFO L134 CoverageAnalysis]: Checked inductivity of 730 backedges. 0 proven. 175 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2019-12-07 17:05:04,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828539060] [2019-12-07 17:05:04,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805625480] [2019-12-07 17:05:04,375 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3d918adf-83f6-447d-aaa7-628b5b410558/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:05:04,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:04,404 INFO L264 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-07 17:05:04,406 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:05:04,481 INFO L134 CoverageAnalysis]: Checked inductivity of 730 backedges. 0 proven. 175 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2019-12-07 17:05:04,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:05:04,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 19 [2019-12-07 17:05:04,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249151378] [2019-12-07 17:05:04,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-07 17:05:04,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:05:04,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-07 17:05:04,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2019-12-07 17:05:04,482 INFO L87 Difference]: Start difference. First operand 224 states and 242 transitions. Second operand 20 states. [2019-12-07 17:05:04,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:05:04,530 INFO L93 Difference]: Finished difference Result 278 states and 308 transitions. [2019-12-07 17:05:04,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 17:05:04,530 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 133 [2019-12-07 17:05:04,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:05:04,531 INFO L225 Difference]: With dead ends: 278 [2019-12-07 17:05:04,531 INFO L226 Difference]: Without dead ends: 237 [2019-12-07 17:05:04,532 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 140 SyntacticMatches, 7 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2019-12-07 17:05:04,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-12-07 17:05:04,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 231. [2019-12-07 17:05:04,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-12-07 17:05:04,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 249 transitions. [2019-12-07 17:05:04,540 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 249 transitions. Word has length 133 [2019-12-07 17:05:04,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:05:04,540 INFO L462 AbstractCegarLoop]: Abstraction has 231 states and 249 transitions. [2019-12-07 17:05:04,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-07 17:05:04,540 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 249 transitions. [2019-12-07 17:05:04,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-12-07 17:05:04,541 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:05:04,541 INFO L410 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1] [2019-12-07 17:05:04,742 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:05:04,742 INFO L410 AbstractCegarLoop]: === Iteration 18 === [hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 17:05:04,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:05:04,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1888355319, now seen corresponding path program 8 times [2019-12-07 17:05:04,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:05:04,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364915542] [2019-12-07 17:05:04,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:05:04,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:04,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:04,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:04,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:04,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:04,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:04,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:04,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:04,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:04,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:04,996 INFO L134 CoverageAnalysis]: Checked inductivity of 426 backedges. 0 proven. 228 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2019-12-07 17:05:04,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364915542] [2019-12-07 17:05:04,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2662167] [2019-12-07 17:05:04,997 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3d918adf-83f6-447d-aaa7-628b5b410558/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:05:05,023 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 17:05:05,023 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:05:05,024 INFO L264 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-07 17:05:05,026 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:05:05,109 INFO L134 CoverageAnalysis]: Checked inductivity of 426 backedges. 0 proven. 228 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2019-12-07 17:05:05,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:05:05,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 21 [2019-12-07 17:05:05,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555419512] [2019-12-07 17:05:05,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-07 17:05:05,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:05:05,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-07 17:05:05,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2019-12-07 17:05:05,111 INFO L87 Difference]: Start difference. First operand 231 states and 249 transitions. Second operand 22 states. [2019-12-07 17:05:05,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:05:05,164 INFO L93 Difference]: Finished difference Result 285 states and 315 transitions. [2019-12-07 17:05:05,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 17:05:05,170 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 110 [2019-12-07 17:05:05,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:05:05,171 INFO L225 Difference]: With dead ends: 285 [2019-12-07 17:05:05,171 INFO L226 Difference]: Without dead ends: 244 [2019-12-07 17:05:05,172 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 118 SyntacticMatches, 8 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2019-12-07 17:05:05,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-12-07 17:05:05,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 238. [2019-12-07 17:05:05,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-12-07 17:05:05,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 256 transitions. [2019-12-07 17:05:05,178 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 256 transitions. Word has length 110 [2019-12-07 17:05:05,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:05:05,178 INFO L462 AbstractCegarLoop]: Abstraction has 238 states and 256 transitions. [2019-12-07 17:05:05,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-07 17:05:05,178 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 256 transitions. [2019-12-07 17:05:05,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-12-07 17:05:05,179 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:05:05,179 INFO L410 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1] [2019-12-07 17:05:05,379 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:05:05,380 INFO L410 AbstractCegarLoop]: === Iteration 19 === [hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 17:05:05,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:05:05,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1336522935, now seen corresponding path program 9 times [2019-12-07 17:05:05,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:05:05,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400595752] [2019-12-07 17:05:05,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:05:05,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:05,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:05,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:05,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:05,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:05,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:05,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:05,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:05,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:05,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:05,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:05,663 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-12-07 17:05:05,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400595752] [2019-12-07 17:05:05,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [883982219] [2019-12-07 17:05:05,663 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3d918adf-83f6-447d-aaa7-628b5b410558/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:05:05,695 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-12-07 17:05:05,695 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:05:05,695 INFO L264 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 21 conjunts are in the unsatisfiable core [2019-12-07 17:05:05,697 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:05:05,793 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-12-07 17:05:05,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:05:05,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 23 [2019-12-07 17:05:05,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622981628] [2019-12-07 17:05:05,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-07 17:05:05,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:05:05,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-07 17:05:05,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2019-12-07 17:05:05,794 INFO L87 Difference]: Start difference. First operand 238 states and 256 transitions. Second operand 24 states. [2019-12-07 17:05:05,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:05:05,857 INFO L93 Difference]: Finished difference Result 292 states and 322 transitions. [2019-12-07 17:05:05,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 17:05:05,857 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 122 [2019-12-07 17:05:05,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:05:05,858 INFO L225 Difference]: With dead ends: 292 [2019-12-07 17:05:05,858 INFO L226 Difference]: Without dead ends: 251 [2019-12-07 17:05:05,859 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 131 SyntacticMatches, 9 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2019-12-07 17:05:05,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-12-07 17:05:05,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 245. [2019-12-07 17:05:05,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-12-07 17:05:05,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 263 transitions. [2019-12-07 17:05:05,866 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 263 transitions. Word has length 122 [2019-12-07 17:05:05,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:05:05,866 INFO L462 AbstractCegarLoop]: Abstraction has 245 states and 263 transitions. [2019-12-07 17:05:05,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-07 17:05:05,867 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 263 transitions. [2019-12-07 17:05:05,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-12-07 17:05:05,868 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:05:05,868 INFO L410 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1] [2019-12-07 17:05:06,068 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:05:06,068 INFO L410 AbstractCegarLoop]: === Iteration 20 === [hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 17:05:06,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:05:06,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1176109879, now seen corresponding path program 10 times [2019-12-07 17:05:06,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:05:06,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473527039] [2019-12-07 17:05:06,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:05:06,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:06,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:06,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:06,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:06,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:06,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:06,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:06,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:06,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:06,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:06,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:06,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:06,464 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 0 proven. 355 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2019-12-07 17:05:06,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473527039] [2019-12-07 17:05:06,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087154135] [2019-12-07 17:05:06,464 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3d918adf-83f6-447d-aaa7-628b5b410558/bin/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:05:06,501 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 17:05:06,501 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:05:06,502 INFO L264 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 23 conjunts are in the unsatisfiable core [2019-12-07 17:05:06,505 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:05:06,636 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 0 proven. 355 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2019-12-07 17:05:06,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:05:06,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 25 [2019-12-07 17:05:06,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696719673] [2019-12-07 17:05:06,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-12-07 17:05:06,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:05:06,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-12-07 17:05:06,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=469, Unknown=0, NotChecked=0, Total=650 [2019-12-07 17:05:06,638 INFO L87 Difference]: Start difference. First operand 245 states and 263 transitions. Second operand 26 states. [2019-12-07 17:05:06,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:05:06,705 INFO L93 Difference]: Finished difference Result 299 states and 329 transitions. [2019-12-07 17:05:06,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 17:05:06,706 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 134 [2019-12-07 17:05:06,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:05:06,707 INFO L225 Difference]: With dead ends: 299 [2019-12-07 17:05:06,707 INFO L226 Difference]: Without dead ends: 258 [2019-12-07 17:05:06,707 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 144 SyntacticMatches, 10 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=181, Invalid=469, Unknown=0, NotChecked=0, Total=650 [2019-12-07 17:05:06,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-12-07 17:05:06,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 252. [2019-12-07 17:05:06,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-12-07 17:05:06,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 270 transitions. [2019-12-07 17:05:06,713 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 270 transitions. Word has length 134 [2019-12-07 17:05:06,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:05:06,713 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 270 transitions. [2019-12-07 17:05:06,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-12-07 17:05:06,713 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 270 transitions. [2019-12-07 17:05:06,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-12-07 17:05:06,714 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:05:06,714 INFO L410 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1] [2019-12-07 17:05:06,915 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:05:06,915 INFO L410 AbstractCegarLoop]: === Iteration 21 === [hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 17:05:06,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:05:06,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1656708873, now seen corresponding path program 11 times [2019-12-07 17:05:06,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:05:06,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017423005] [2019-12-07 17:05:06,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:05:06,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:06,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:06,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:06,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:07,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:07,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:07,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:07,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:07,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:07,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:07,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:07,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:07,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:07,297 INFO L134 CoverageAnalysis]: Checked inductivity of 783 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2019-12-07 17:05:07,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017423005] [2019-12-07 17:05:07,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854435594] [2019-12-07 17:05:07,297 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3d918adf-83f6-447d-aaa7-628b5b410558/bin/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:05:07,331 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2019-12-07 17:05:07,331 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:05:07,332 INFO L264 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 25 conjunts are in the unsatisfiable core [2019-12-07 17:05:07,334 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:05:07,469 INFO L134 CoverageAnalysis]: Checked inductivity of 783 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2019-12-07 17:05:07,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:05:07,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 27 [2019-12-07 17:05:07,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424068568] [2019-12-07 17:05:07,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-12-07 17:05:07,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:05:07,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-07 17:05:07,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=547, Unknown=0, NotChecked=0, Total=756 [2019-12-07 17:05:07,470 INFO L87 Difference]: Start difference. First operand 252 states and 270 transitions. Second operand 28 states. [2019-12-07 17:05:07,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:05:07,540 INFO L93 Difference]: Finished difference Result 306 states and 336 transitions. [2019-12-07 17:05:07,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-07 17:05:07,541 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 146 [2019-12-07 17:05:07,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:05:07,542 INFO L225 Difference]: With dead ends: 306 [2019-12-07 17:05:07,542 INFO L226 Difference]: Without dead ends: 265 [2019-12-07 17:05:07,542 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 157 SyntacticMatches, 11 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=209, Invalid=547, Unknown=0, NotChecked=0, Total=756 [2019-12-07 17:05:07,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-12-07 17:05:07,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 259. [2019-12-07 17:05:07,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-12-07 17:05:07,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 277 transitions. [2019-12-07 17:05:07,549 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 277 transitions. Word has length 146 [2019-12-07 17:05:07,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:05:07,549 INFO L462 AbstractCegarLoop]: Abstraction has 259 states and 277 transitions. [2019-12-07 17:05:07,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-12-07 17:05:07,549 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 277 transitions. [2019-12-07 17:05:07,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-12-07 17:05:07,550 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:05:07,550 INFO L410 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 13, 13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1] [2019-12-07 17:05:07,750 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:05:07,751 INFO L410 AbstractCegarLoop]: === Iteration 22 === [hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 17:05:07,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:05:07,751 INFO L82 PathProgramCache]: Analyzing trace with hash -2039869892, now seen corresponding path program 12 times [2019-12-07 17:05:07,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:05:07,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106974838] [2019-12-07 17:05:07,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:05:07,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:07,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:07,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:07,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:07,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:07,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:07,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:07,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:07,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:07,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:07,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:08,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:08,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:08,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:08,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1500 backedges. 0 proven. 510 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-12-07 17:05:08,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106974838] [2019-12-07 17:05:08,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125626293] [2019-12-07 17:05:08,196 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3d918adf-83f6-447d-aaa7-628b5b410558/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:05:08,240 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2019-12-07 17:05:08,240 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:05:08,241 INFO L264 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 27 conjunts are in the unsatisfiable core [2019-12-07 17:05:08,243 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:05:08,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1500 backedges. 0 proven. 510 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-12-07 17:05:08,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:05:08,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 29 [2019-12-07 17:05:08,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125773941] [2019-12-07 17:05:08,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-07 17:05:08,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:05:08,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-07 17:05:08,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=631, Unknown=0, NotChecked=0, Total=870 [2019-12-07 17:05:08,398 INFO L87 Difference]: Start difference. First operand 259 states and 277 transitions. Second operand 30 states. [2019-12-07 17:05:08,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:05:08,470 INFO L93 Difference]: Finished difference Result 313 states and 343 transitions. [2019-12-07 17:05:08,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-07 17:05:08,470 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 193 [2019-12-07 17:05:08,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:05:08,472 INFO L225 Difference]: With dead ends: 313 [2019-12-07 17:05:08,472 INFO L226 Difference]: Without dead ends: 272 [2019-12-07 17:05:08,472 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 205 SyntacticMatches, 12 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 418 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=239, Invalid=631, Unknown=0, NotChecked=0, Total=870 [2019-12-07 17:05:08,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-12-07 17:05:08,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 266. [2019-12-07 17:05:08,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-12-07 17:05:08,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 284 transitions. [2019-12-07 17:05:08,478 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 284 transitions. Word has length 193 [2019-12-07 17:05:08,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:05:08,478 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 284 transitions. [2019-12-07 17:05:08,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-07 17:05:08,478 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 284 transitions. [2019-12-07 17:05:08,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-12-07 17:05:08,480 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:05:08,480 INFO L410 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 14, 14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1] [2019-12-07 17:05:08,680 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:05:08,680 INFO L410 AbstractCegarLoop]: === Iteration 23 === [hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 17:05:08,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:05:08,681 INFO L82 PathProgramCache]: Analyzing trace with hash 350954254, now seen corresponding path program 13 times [2019-12-07 17:05:08,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:05:08,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77687282] [2019-12-07 17:05:08,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:05:08,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:08,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:08,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:08,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:08,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:08,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:08,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:08,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:08,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:08,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:08,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:08,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:08,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:09,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:09,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:09,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1690 backedges. 0 proven. 598 refuted. 0 times theorem prover too weak. 1092 trivial. 0 not checked. [2019-12-07 17:05:09,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77687282] [2019-12-07 17:05:09,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329978091] [2019-12-07 17:05:09,141 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3d918adf-83f6-447d-aaa7-628b5b410558/bin/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:05:09,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:09,178 INFO L264 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 29 conjunts are in the unsatisfiable core [2019-12-07 17:05:09,180 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:05:09,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1690 backedges. 0 proven. 598 refuted. 0 times theorem prover too weak. 1092 trivial. 0 not checked. [2019-12-07 17:05:09,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:05:09,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 31 [2019-12-07 17:05:09,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442070185] [2019-12-07 17:05:09,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-12-07 17:05:09,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:05:09,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-12-07 17:05:09,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=721, Unknown=0, NotChecked=0, Total=992 [2019-12-07 17:05:09,371 INFO L87 Difference]: Start difference. First operand 266 states and 284 transitions. Second operand 32 states. [2019-12-07 17:05:09,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:05:09,440 INFO L93 Difference]: Finished difference Result 320 states and 350 transitions. [2019-12-07 17:05:09,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-07 17:05:09,440 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 205 [2019-12-07 17:05:09,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:05:09,441 INFO L225 Difference]: With dead ends: 320 [2019-12-07 17:05:09,441 INFO L226 Difference]: Without dead ends: 279 [2019-12-07 17:05:09,442 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 218 SyntacticMatches, 13 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=271, Invalid=721, Unknown=0, NotChecked=0, Total=992 [2019-12-07 17:05:09,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-12-07 17:05:09,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 273. [2019-12-07 17:05:09,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-12-07 17:05:09,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 291 transitions. [2019-12-07 17:05:09,447 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 291 transitions. Word has length 205 [2019-12-07 17:05:09,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:05:09,447 INFO L462 AbstractCegarLoop]: Abstraction has 273 states and 291 transitions. [2019-12-07 17:05:09,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-12-07 17:05:09,448 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 291 transitions. [2019-12-07 17:05:09,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-12-07 17:05:09,449 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:05:09,449 INFO L410 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 15, 15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1] [2019-12-07 17:05:09,649 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:05:09,649 INFO L410 AbstractCegarLoop]: === Iteration 24 === [hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 17:05:09,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:05:09,649 INFO L82 PathProgramCache]: Analyzing trace with hash -419025284, now seen corresponding path program 14 times [2019-12-07 17:05:09,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:05:09,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13442727] [2019-12-07 17:05:09,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:05:09,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:09,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:09,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:09,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:09,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:09,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:09,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:09,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:09,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:09,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:09,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:09,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:09,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:09,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:10,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:10,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:10,199 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 693 refuted. 0 times theorem prover too weak. 1199 trivial. 0 not checked. [2019-12-07 17:05:10,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13442727] [2019-12-07 17:05:10,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89569347] [2019-12-07 17:05:10,199 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3d918adf-83f6-447d-aaa7-628b5b410558/bin/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:05:10,236 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 17:05:10,236 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:05:10,237 INFO L264 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 31 conjunts are in the unsatisfiable core [2019-12-07 17:05:10,239 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:05:10,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 693 refuted. 0 times theorem prover too weak. 1199 trivial. 0 not checked. [2019-12-07 17:05:10,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:05:10,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 33 [2019-12-07 17:05:10,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380442354] [2019-12-07 17:05:10,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-12-07 17:05:10,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:05:10,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-12-07 17:05:10,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=817, Unknown=0, NotChecked=0, Total=1122 [2019-12-07 17:05:10,447 INFO L87 Difference]: Start difference. First operand 273 states and 291 transitions. Second operand 34 states. [2019-12-07 17:05:10,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:05:10,528 INFO L93 Difference]: Finished difference Result 327 states and 357 transitions. [2019-12-07 17:05:10,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-07 17:05:10,529 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 217 [2019-12-07 17:05:10,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:05:10,530 INFO L225 Difference]: With dead ends: 327 [2019-12-07 17:05:10,530 INFO L226 Difference]: Without dead ends: 286 [2019-12-07 17:05:10,531 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 231 SyntacticMatches, 14 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 557 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=305, Invalid=817, Unknown=0, NotChecked=0, Total=1122 [2019-12-07 17:05:10,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-12-07 17:05:10,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 280. [2019-12-07 17:05:10,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-12-07 17:05:10,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 298 transitions. [2019-12-07 17:05:10,536 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 298 transitions. Word has length 217 [2019-12-07 17:05:10,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:05:10,536 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 298 transitions. [2019-12-07 17:05:10,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-12-07 17:05:10,536 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 298 transitions. [2019-12-07 17:05:10,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-12-07 17:05:10,537 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:05:10,537 INFO L410 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1] [2019-12-07 17:05:10,737 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:05:10,738 INFO L410 AbstractCegarLoop]: === Iteration 25 === [hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 17:05:10,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:05:10,738 INFO L82 PathProgramCache]: Analyzing trace with hash 537467854, now seen corresponding path program 15 times [2019-12-07 17:05:10,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:05:10,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748094489] [2019-12-07 17:05:10,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:05:10,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:10,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:10,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:10,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:10,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:10,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:10,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:10,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:10,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:10,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:10,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:11,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:11,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:11,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:11,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:11,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:11,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:11,326 INFO L134 CoverageAnalysis]: Checked inductivity of 2106 backedges. 0 proven. 795 refuted. 0 times theorem prover too weak. 1311 trivial. 0 not checked. [2019-12-07 17:05:11,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748094489] [2019-12-07 17:05:11,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294610839] [2019-12-07 17:05:11,327 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3d918adf-83f6-447d-aaa7-628b5b410558/bin/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:05:11,371 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-12-07 17:05:11,372 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:05:11,373 INFO L264 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 33 conjunts are in the unsatisfiable core [2019-12-07 17:05:11,375 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:05:11,612 INFO L134 CoverageAnalysis]: Checked inductivity of 2106 backedges. 0 proven. 795 refuted. 0 times theorem prover too weak. 1311 trivial. 0 not checked. [2019-12-07 17:05:11,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:05:11,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 35 [2019-12-07 17:05:11,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842842410] [2019-12-07 17:05:11,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-12-07 17:05:11,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:05:11,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-12-07 17:05:11,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=919, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 17:05:11,613 INFO L87 Difference]: Start difference. First operand 280 states and 298 transitions. Second operand 36 states. [2019-12-07 17:05:11,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:05:11,700 INFO L93 Difference]: Finished difference Result 334 states and 364 transitions. [2019-12-07 17:05:11,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-07 17:05:11,700 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 229 [2019-12-07 17:05:11,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:05:11,701 INFO L225 Difference]: With dead ends: 334 [2019-12-07 17:05:11,701 INFO L226 Difference]: Without dead ends: 293 [2019-12-07 17:05:11,702 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 244 SyntacticMatches, 15 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 634 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=341, Invalid=919, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 17:05:11,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-12-07 17:05:11,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 287. [2019-12-07 17:05:11,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-12-07 17:05:11,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 305 transitions. [2019-12-07 17:05:11,708 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 305 transitions. Word has length 229 [2019-12-07 17:05:11,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:05:11,709 INFO L462 AbstractCegarLoop]: Abstraction has 287 states and 305 transitions. [2019-12-07 17:05:11,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-12-07 17:05:11,709 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 305 transitions. [2019-12-07 17:05:11,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-12-07 17:05:11,711 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:05:11,711 INFO L410 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 17, 17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1] [2019-12-07 17:05:11,911 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:05:11,912 INFO L410 AbstractCegarLoop]: === Iteration 26 === [hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 17:05:11,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:05:11,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1353465532, now seen corresponding path program 16 times [2019-12-07 17:05:11,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:05:11,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105377427] [2019-12-07 17:05:11,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:05:11,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:11,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:11,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:11,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:12,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:12,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:12,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:12,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:12,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:12,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:12,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:12,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:12,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:12,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:12,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:12,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:12,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:12,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:12,581 INFO L134 CoverageAnalysis]: Checked inductivity of 2332 backedges. 0 proven. 904 refuted. 0 times theorem prover too weak. 1428 trivial. 0 not checked. [2019-12-07 17:05:12,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105377427] [2019-12-07 17:05:12,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387753934] [2019-12-07 17:05:12,581 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3d918adf-83f6-447d-aaa7-628b5b410558/bin/uautomizer/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:05:12,622 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 17:05:12,622 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:05:12,623 INFO L264 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 35 conjunts are in the unsatisfiable core [2019-12-07 17:05:12,626 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:05:12,866 INFO L134 CoverageAnalysis]: Checked inductivity of 2332 backedges. 0 proven. 904 refuted. 0 times theorem prover too weak. 1428 trivial. 0 not checked. [2019-12-07 17:05:12,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:05:12,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 37 [2019-12-07 17:05:12,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155185460] [2019-12-07 17:05:12,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-12-07 17:05:12,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:05:12,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-12-07 17:05:12,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=1027, Unknown=0, NotChecked=0, Total=1406 [2019-12-07 17:05:12,867 INFO L87 Difference]: Start difference. First operand 287 states and 305 transitions. Second operand 38 states. [2019-12-07 17:05:12,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:05:12,954 INFO L93 Difference]: Finished difference Result 341 states and 371 transitions. [2019-12-07 17:05:12,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-07 17:05:12,955 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 241 [2019-12-07 17:05:12,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:05:12,956 INFO L225 Difference]: With dead ends: 341 [2019-12-07 17:05:12,956 INFO L226 Difference]: Without dead ends: 300 [2019-12-07 17:05:12,957 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 257 SyntacticMatches, 16 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 716 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=379, Invalid=1027, Unknown=0, NotChecked=0, Total=1406 [2019-12-07 17:05:12,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-12-07 17:05:12,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 294. [2019-12-07 17:05:12,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-12-07 17:05:12,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 312 transitions. [2019-12-07 17:05:12,962 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 312 transitions. Word has length 241 [2019-12-07 17:05:12,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:05:12,962 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 312 transitions. [2019-12-07 17:05:12,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-12-07 17:05:12,962 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 312 transitions. [2019-12-07 17:05:12,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-12-07 17:05:12,963 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:05:12,963 INFO L410 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 18, 18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1] [2019-12-07 17:05:13,164 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:05:13,164 INFO L410 AbstractCegarLoop]: === Iteration 27 === [hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 17:05:13,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:05:13,164 INFO L82 PathProgramCache]: Analyzing trace with hash -843307890, now seen corresponding path program 17 times [2019-12-07 17:05:13,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:05:13,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109365066] [2019-12-07 17:05:13,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:05:13,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:13,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:13,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:13,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:13,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:13,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:13,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:13,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:13,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:13,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:13,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:13,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:13,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:13,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:13,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:13,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:13,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:13,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:13,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:13,913 INFO L134 CoverageAnalysis]: Checked inductivity of 2570 backedges. 0 proven. 1020 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2019-12-07 17:05:13,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109365066] [2019-12-07 17:05:13,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975639412] [2019-12-07 17:05:13,914 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3d918adf-83f6-447d-aaa7-628b5b410558/bin/uautomizer/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:05:13,972 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 26 check-sat command(s) [2019-12-07 17:05:13,972 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:05:13,974 INFO L264 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 37 conjunts are in the unsatisfiable core [2019-12-07 17:05:13,976 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:05:14,261 INFO L134 CoverageAnalysis]: Checked inductivity of 2570 backedges. 0 proven. 1020 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2019-12-07 17:05:14,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:05:14,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 39 [2019-12-07 17:05:14,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454131558] [2019-12-07 17:05:14,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-12-07 17:05:14,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:05:14,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-12-07 17:05:14,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=1141, Unknown=0, NotChecked=0, Total=1560 [2019-12-07 17:05:14,263 INFO L87 Difference]: Start difference. First operand 294 states and 312 transitions. Second operand 40 states. [2019-12-07 17:05:14,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:05:14,360 INFO L93 Difference]: Finished difference Result 348 states and 378 transitions. [2019-12-07 17:05:14,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-07 17:05:14,360 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 253 [2019-12-07 17:05:14,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:05:14,362 INFO L225 Difference]: With dead ends: 348 [2019-12-07 17:05:14,362 INFO L226 Difference]: Without dead ends: 307 [2019-12-07 17:05:14,363 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 270 SyntacticMatches, 17 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 803 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=419, Invalid=1141, Unknown=0, NotChecked=0, Total=1560 [2019-12-07 17:05:14,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-12-07 17:05:14,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 301. [2019-12-07 17:05:14,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-12-07 17:05:14,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 319 transitions. [2019-12-07 17:05:14,371 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 319 transitions. Word has length 253 [2019-12-07 17:05:14,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:05:14,371 INFO L462 AbstractCegarLoop]: Abstraction has 301 states and 319 transitions. [2019-12-07 17:05:14,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-12-07 17:05:14,371 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 319 transitions. [2019-12-07 17:05:14,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-12-07 17:05:14,373 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:05:14,373 INFO L410 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 26, 19, 19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1] [2019-12-07 17:05:14,574 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:05:14,574 INFO L410 AbstractCegarLoop]: === Iteration 28 === [hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 17:05:14,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:05:14,574 INFO L82 PathProgramCache]: Analyzing trace with hash 186138364, now seen corresponding path program 18 times [2019-12-07 17:05:14,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:05:14,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966632194] [2019-12-07 17:05:14,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:05:14,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:14,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:14,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:14,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:14,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:14,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:14,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:14,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:14,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:14,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:14,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:14,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:14,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:14,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:15,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:15,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:15,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:15,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:15,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:15,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:15,442 INFO L134 CoverageAnalysis]: Checked inductivity of 2820 backedges. 0 proven. 1143 refuted. 0 times theorem prover too weak. 1677 trivial. 0 not checked. [2019-12-07 17:05:15,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966632194] [2019-12-07 17:05:15,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115051765] [2019-12-07 17:05:15,442 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3d918adf-83f6-447d-aaa7-628b5b410558/bin/uautomizer/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:05:15,499 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) [2019-12-07 17:05:15,500 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:05:15,501 INFO L264 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 39 conjunts are in the unsatisfiable core [2019-12-07 17:05:15,503 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:05:15,798 INFO L134 CoverageAnalysis]: Checked inductivity of 2820 backedges. 0 proven. 1143 refuted. 0 times theorem prover too weak. 1677 trivial. 0 not checked. [2019-12-07 17:05:15,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:05:15,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 41 [2019-12-07 17:05:15,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704193167] [2019-12-07 17:05:15,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-12-07 17:05:15,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:05:15,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-12-07 17:05:15,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=461, Invalid=1261, Unknown=0, NotChecked=0, Total=1722 [2019-12-07 17:05:15,800 INFO L87 Difference]: Start difference. First operand 301 states and 319 transitions. Second operand 42 states. [2019-12-07 17:05:15,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:05:15,899 INFO L93 Difference]: Finished difference Result 355 states and 385 transitions. [2019-12-07 17:05:15,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-07 17:05:15,899 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 265 [2019-12-07 17:05:15,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:05:15,900 INFO L225 Difference]: With dead ends: 355 [2019-12-07 17:05:15,900 INFO L226 Difference]: Without dead ends: 314 [2019-12-07 17:05:15,901 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 283 SyntacticMatches, 18 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 895 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=461, Invalid=1261, Unknown=0, NotChecked=0, Total=1722 [2019-12-07 17:05:15,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-12-07 17:05:15,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 308. [2019-12-07 17:05:15,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-12-07 17:05:15,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 326 transitions. [2019-12-07 17:05:15,906 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 326 transitions. Word has length 265 [2019-12-07 17:05:15,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:05:15,907 INFO L462 AbstractCegarLoop]: Abstraction has 308 states and 326 transitions. [2019-12-07 17:05:15,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-12-07 17:05:15,907 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 326 transitions. [2019-12-07 17:05:15,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-12-07 17:05:15,908 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:05:15,908 INFO L410 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1] [2019-12-07 17:05:16,109 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:05:16,109 INFO L410 AbstractCegarLoop]: === Iteration 29 === [hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 17:05:16,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:05:16,109 INFO L82 PathProgramCache]: Analyzing trace with hash 420240905, now seen corresponding path program 19 times [2019-12-07 17:05:16,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:05:16,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365253995] [2019-12-07 17:05:16,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:05:16,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:16,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:16,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:16,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:16,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:16,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:16,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:16,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:16,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:16,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:16,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:16,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:16,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:16,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:16,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:16,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:16,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:16,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:16,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:16,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:16,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:17,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2263 backedges. 0 proven. 1273 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-12-07 17:05:17,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365253995] [2019-12-07 17:05:17,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916157832] [2019-12-07 17:05:17,004 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3d918adf-83f6-447d-aaa7-628b5b410558/bin/uautomizer/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:05:17,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:17,050 INFO L264 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 41 conjunts are in the unsatisfiable core [2019-12-07 17:05:17,053 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:05:17,355 INFO L134 CoverageAnalysis]: Checked inductivity of 2263 backedges. 0 proven. 1273 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-12-07 17:05:17,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:05:17,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 43 [2019-12-07 17:05:17,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346497409] [2019-12-07 17:05:17,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-12-07 17:05:17,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:05:17,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-12-07 17:05:17,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=505, Invalid=1387, Unknown=0, NotChecked=0, Total=1892 [2019-12-07 17:05:17,357 INFO L87 Difference]: Start difference. First operand 308 states and 326 transitions. Second operand 44 states. [2019-12-07 17:05:17,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:05:17,459 INFO L93 Difference]: Finished difference Result 362 states and 392 transitions. [2019-12-07 17:05:17,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-07 17:05:17,459 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 242 [2019-12-07 17:05:17,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:05:17,460 INFO L225 Difference]: With dead ends: 362 [2019-12-07 17:05:17,461 INFO L226 Difference]: Without dead ends: 321 [2019-12-07 17:05:17,461 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 261 SyntacticMatches, 19 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 992 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=505, Invalid=1387, Unknown=0, NotChecked=0, Total=1892 [2019-12-07 17:05:17,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-12-07 17:05:17,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 315. [2019-12-07 17:05:17,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-12-07 17:05:17,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 333 transitions. [2019-12-07 17:05:17,466 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 333 transitions. Word has length 242 [2019-12-07 17:05:17,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:05:17,467 INFO L462 AbstractCegarLoop]: Abstraction has 315 states and 333 transitions. [2019-12-07 17:05:17,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-12-07 17:05:17,467 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 333 transitions. [2019-12-07 17:05:17,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2019-12-07 17:05:17,468 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:05:17,468 INFO L410 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 21, 21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1] [2019-12-07 17:05:17,668 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:05:17,669 INFO L410 AbstractCegarLoop]: === Iteration 30 === [hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 17:05:17,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:05:17,669 INFO L82 PathProgramCache]: Analyzing trace with hash -2063192260, now seen corresponding path program 20 times [2019-12-07 17:05:17,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:05:17,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025683704] [2019-12-07 17:05:17,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:05:17,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:17,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:17,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:17,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:17,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:17,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:17,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:17,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:17,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:17,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:17,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:18,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:18,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:18,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:18,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:18,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:18,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:18,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:18,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:18,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:18,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:18,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:18,651 INFO L134 CoverageAnalysis]: Checked inductivity of 3356 backedges. 0 proven. 1410 refuted. 0 times theorem prover too weak. 1946 trivial. 0 not checked. [2019-12-07 17:05:18,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025683704] [2019-12-07 17:05:18,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833012855] [2019-12-07 17:05:18,652 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3d918adf-83f6-447d-aaa7-628b5b410558/bin/uautomizer/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:05:18,696 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 17:05:18,696 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:05:18,698 INFO L264 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 43 conjunts are in the unsatisfiable core [2019-12-07 17:05:18,700 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:05:19,040 INFO L134 CoverageAnalysis]: Checked inductivity of 3356 backedges. 0 proven. 1410 refuted. 0 times theorem prover too weak. 1946 trivial. 0 not checked. [2019-12-07 17:05:19,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:05:19,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 45 [2019-12-07 17:05:19,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523637622] [2019-12-07 17:05:19,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-12-07 17:05:19,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:05:19,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-12-07 17:05:19,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=551, Invalid=1519, Unknown=0, NotChecked=0, Total=2070 [2019-12-07 17:05:19,042 INFO L87 Difference]: Start difference. First operand 315 states and 333 transitions. Second operand 46 states. [2019-12-07 17:05:19,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:05:19,157 INFO L93 Difference]: Finished difference Result 369 states and 399 transitions. [2019-12-07 17:05:19,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-07 17:05:19,157 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 289 [2019-12-07 17:05:19,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:05:19,159 INFO L225 Difference]: With dead ends: 369 [2019-12-07 17:05:19,159 INFO L226 Difference]: Without dead ends: 328 [2019-12-07 17:05:19,160 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 309 SyntacticMatches, 20 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1094 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=551, Invalid=1519, Unknown=0, NotChecked=0, Total=2070 [2019-12-07 17:05:19,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-12-07 17:05:19,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 322. [2019-12-07 17:05:19,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-12-07 17:05:19,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 340 transitions. [2019-12-07 17:05:19,167 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 340 transitions. Word has length 289 [2019-12-07 17:05:19,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:05:19,168 INFO L462 AbstractCegarLoop]: Abstraction has 322 states and 340 transitions. [2019-12-07 17:05:19,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-12-07 17:05:19,168 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 340 transitions. [2019-12-07 17:05:19,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-12-07 17:05:19,170 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:05:19,171 INFO L410 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 1, 1, 1, 1, 1] [2019-12-07 17:05:19,371 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:05:19,372 INFO L410 AbstractCegarLoop]: === Iteration 31 === [hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 17:05:19,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:05:19,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1826765367, now seen corresponding path program 21 times [2019-12-07 17:05:19,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:05:19,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220120050] [2019-12-07 17:05:19,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:05:19,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:19,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:19,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:19,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:19,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:19,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:19,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:19,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:19,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:19,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:19,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:19,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:19,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:19,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:19,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:19,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:19,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:19,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:19,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:20,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:20,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:20,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:20,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:20,481 INFO L134 CoverageAnalysis]: Checked inductivity of 2753 backedges. 0 proven. 1554 refuted. 0 times theorem prover too weak. 1199 trivial. 0 not checked. [2019-12-07 17:05:20,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220120050] [2019-12-07 17:05:20,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041536097] [2019-12-07 17:05:20,481 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3d918adf-83f6-447d-aaa7-628b5b410558/bin/uautomizer/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:05:20,537 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-12-07 17:05:20,537 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:05:20,538 INFO L264 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 45 conjunts are in the unsatisfiable core [2019-12-07 17:05:20,540 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:05:20,895 INFO L134 CoverageAnalysis]: Checked inductivity of 2753 backedges. 0 proven. 1554 refuted. 0 times theorem prover too weak. 1199 trivial. 0 not checked. [2019-12-07 17:05:20,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:05:20,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 47 [2019-12-07 17:05:20,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177219809] [2019-12-07 17:05:20,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-12-07 17:05:20,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:05:20,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-12-07 17:05:20,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=599, Invalid=1657, Unknown=0, NotChecked=0, Total=2256 [2019-12-07 17:05:20,897 INFO L87 Difference]: Start difference. First operand 322 states and 340 transitions. Second operand 48 states. [2019-12-07 17:05:21,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:05:21,008 INFO L93 Difference]: Finished difference Result 376 states and 406 transitions. [2019-12-07 17:05:21,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-07 17:05:21,009 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 266 [2019-12-07 17:05:21,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:05:21,010 INFO L225 Difference]: With dead ends: 376 [2019-12-07 17:05:21,010 INFO L226 Difference]: Without dead ends: 335 [2019-12-07 17:05:21,011 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 287 SyntacticMatches, 21 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1201 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=599, Invalid=1657, Unknown=0, NotChecked=0, Total=2256 [2019-12-07 17:05:21,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2019-12-07 17:05:21,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 329. [2019-12-07 17:05:21,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-12-07 17:05:21,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 347 transitions. [2019-12-07 17:05:21,016 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 347 transitions. Word has length 266 [2019-12-07 17:05:21,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:05:21,016 INFO L462 AbstractCegarLoop]: Abstraction has 329 states and 347 transitions. [2019-12-07 17:05:21,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-12-07 17:05:21,017 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 347 transitions. [2019-12-07 17:05:21,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-12-07 17:05:21,018 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:05:21,018 INFO L410 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 23, 23, 23, 22, 22, 22, 22, 1, 1, 1, 1, 1] [2019-12-07 17:05:21,219 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:05:21,219 INFO L410 AbstractCegarLoop]: === Iteration 32 === [hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 17:05:21,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:05:21,219 INFO L82 PathProgramCache]: Analyzing trace with hash 338825084, now seen corresponding path program 22 times [2019-12-07 17:05:21,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:05:21,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634390861] [2019-12-07 17:05:21,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:05:21,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:21,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:21,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:21,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:21,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:21,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:21,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:21,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:21,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:21,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:21,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:21,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:21,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:21,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:21,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:21,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:21,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:21,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:21,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:21,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:21,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:21,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:22,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:22,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:22,462 INFO L134 CoverageAnalysis]: Checked inductivity of 3940 backedges. 0 proven. 1705 refuted. 0 times theorem prover too weak. 2235 trivial. 0 not checked. [2019-12-07 17:05:22,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634390861] [2019-12-07 17:05:22,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080845919] [2019-12-07 17:05:22,463 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3d918adf-83f6-447d-aaa7-628b5b410558/bin/uautomizer/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:05:22,509 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 17:05:22,509 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:05:22,510 INFO L264 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 47 conjunts are in the unsatisfiable core [2019-12-07 17:05:22,513 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:05:22,918 INFO L134 CoverageAnalysis]: Checked inductivity of 3940 backedges. 0 proven. 1705 refuted. 0 times theorem prover too weak. 2235 trivial. 0 not checked. [2019-12-07 17:05:22,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:05:22,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 49 [2019-12-07 17:05:22,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618157910] [2019-12-07 17:05:22,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-12-07 17:05:22,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:05:22,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-12-07 17:05:22,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=649, Invalid=1801, Unknown=0, NotChecked=0, Total=2450 [2019-12-07 17:05:22,920 INFO L87 Difference]: Start difference. First operand 329 states and 347 transitions. Second operand 50 states. [2019-12-07 17:05:23,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:05:23,039 INFO L93 Difference]: Finished difference Result 383 states and 413 transitions. [2019-12-07 17:05:23,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-07 17:05:23,039 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 313 [2019-12-07 17:05:23,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:05:23,040 INFO L225 Difference]: With dead ends: 383 [2019-12-07 17:05:23,041 INFO L226 Difference]: Without dead ends: 342 [2019-12-07 17:05:23,042 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 335 SyntacticMatches, 22 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1313 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=649, Invalid=1801, Unknown=0, NotChecked=0, Total=2450 [2019-12-07 17:05:23,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-12-07 17:05:23,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 336. [2019-12-07 17:05:23,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-12-07 17:05:23,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 354 transitions. [2019-12-07 17:05:23,049 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 354 transitions. Word has length 313 [2019-12-07 17:05:23,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:05:23,049 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 354 transitions. [2019-12-07 17:05:23,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-12-07 17:05:23,050 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 354 transitions. [2019-12-07 17:05:23,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2019-12-07 17:05:23,052 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:05:23,052 INFO L410 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 23, 1, 1, 1, 1, 1] [2019-12-07 17:05:23,252 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:05:23,253 INFO L410 AbstractCegarLoop]: === Iteration 33 === [hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 17:05:23,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:05:23,253 INFO L82 PathProgramCache]: Analyzing trace with hash 117652873, now seen corresponding path program 23 times [2019-12-07 17:05:23,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:05:23,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995991579] [2019-12-07 17:05:23,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:05:23,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:23,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:23,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:23,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:23,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:23,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:23,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:23,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:23,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:23,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:23,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:23,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:23,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:23,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:23,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:23,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:23,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:23,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:23,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:23,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:23,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:24,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:24,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:24,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:24,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:24,583 INFO L134 CoverageAnalysis]: Checked inductivity of 3291 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 1428 trivial. 0 not checked. [2019-12-07 17:05:24,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995991579] [2019-12-07 17:05:24,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140637207] [2019-12-07 17:05:24,584 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3d918adf-83f6-447d-aaa7-628b5b410558/bin/uautomizer/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:05:24,644 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2019-12-07 17:05:24,644 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:05:24,646 INFO L264 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 49 conjunts are in the unsatisfiable core [2019-12-07 17:05:24,648 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:05:25,066 INFO L134 CoverageAnalysis]: Checked inductivity of 3291 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 1428 trivial. 0 not checked. [2019-12-07 17:05:25,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:05:25,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 51 [2019-12-07 17:05:25,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771829281] [2019-12-07 17:05:25,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-12-07 17:05:25,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:05:25,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-12-07 17:05:25,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=701, Invalid=1951, Unknown=0, NotChecked=0, Total=2652 [2019-12-07 17:05:25,068 INFO L87 Difference]: Start difference. First operand 336 states and 354 transitions. Second operand 52 states. [2019-12-07 17:05:25,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:05:25,191 INFO L93 Difference]: Finished difference Result 390 states and 420 transitions. [2019-12-07 17:05:25,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-07 17:05:25,191 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 290 [2019-12-07 17:05:25,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:05:25,192 INFO L225 Difference]: With dead ends: 390 [2019-12-07 17:05:25,192 INFO L226 Difference]: Without dead ends: 349 [2019-12-07 17:05:25,194 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 313 SyntacticMatches, 23 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1430 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=701, Invalid=1951, Unknown=0, NotChecked=0, Total=2652 [2019-12-07 17:05:25,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2019-12-07 17:05:25,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 343. [2019-12-07 17:05:25,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-12-07 17:05:25,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 361 transitions. [2019-12-07 17:05:25,199 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 361 transitions. Word has length 290 [2019-12-07 17:05:25,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:05:25,199 INFO L462 AbstractCegarLoop]: Abstraction has 343 states and 361 transitions. [2019-12-07 17:05:25,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-12-07 17:05:25,199 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 361 transitions. [2019-12-07 17:05:25,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2019-12-07 17:05:25,200 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:05:25,201 INFO L410 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 25, 25, 25, 24, 24, 24, 24, 1, 1, 1, 1, 1] [2019-12-07 17:05:25,401 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:05:25,401 INFO L410 AbstractCegarLoop]: === Iteration 34 === [hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 17:05:25,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:05:25,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1252532292, now seen corresponding path program 24 times [2019-12-07 17:05:25,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:05:25,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954725018] [2019-12-07 17:05:25,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:05:25,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:25,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:25,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:25,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:25,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:25,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:25,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:25,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:26,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:26,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:26,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:26,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:26,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:26,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:26,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:26,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:26,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:26,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:26,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:26,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:26,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:26,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:26,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:26,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:26,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:26,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:27,165 INFO L134 CoverageAnalysis]: Checked inductivity of 4572 backedges. 2072 proven. 1072 refuted. 0 times theorem prover too weak. 1428 trivial. 0 not checked. [2019-12-07 17:05:27,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954725018] [2019-12-07 17:05:27,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366215337] [2019-12-07 17:05:27,166 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3d918adf-83f6-447d-aaa7-628b5b410558/bin/uautomizer/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:05:27,242 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 33 check-sat command(s) [2019-12-07 17:05:27,242 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:05:27,244 INFO L264 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 51 conjunts are in the unsatisfiable core [2019-12-07 17:05:27,246 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:05:42,593 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_hanoi_#res_BEFORE_RETURN_306| Int) (|v_hanoi_#res_BEFORE_RETURN_305| Int) (|v_hanoi_#res_BEFORE_RETURN_304| Int) (|v_hanoi_#res_BEFORE_RETURN_303| Int)) (and (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_306| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_305|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_305| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_304|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_303| (- 1)) 1) (- 2)) 1) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_304| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_303|) (<= |c_hanoi_#t~ret0| |v_hanoi_#res_BEFORE_RETURN_306|))) is different from true [2019-12-07 17:05:44,630 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_hanoi_#res_BEFORE_RETURN_306| Int) (|v_hanoi_#res_BEFORE_RETURN_305| Int) (|v_hanoi_#res_BEFORE_RETURN_304| Int) (|v_hanoi_#res_BEFORE_RETURN_303| Int)) (and (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_306| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_305|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_305| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_304|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_303| (- 1)) 1) (- 2)) 1) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_304| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_303|) (<= (div (+ (- |c_hanoi_#res|) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_306|))) is different from true [2019-12-07 17:05:46,654 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_hanoi_#res_BEFORE_RETURN_306| Int) (|v_hanoi_#res_BEFORE_RETURN_305| Int) (|v_hanoi_#res_BEFORE_RETURN_307| Int) (|v_hanoi_#res_BEFORE_RETURN_304| Int) (|v_hanoi_#res_BEFORE_RETURN_303| Int)) (and (<= |c_hanoi_#t~ret0| |v_hanoi_#res_BEFORE_RETURN_307|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_306| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_305|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_305| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_304|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_303| (- 1)) 1) (- 2)) 1) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_304| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_303|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_307| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_306|))) is different from true [2019-12-07 17:05:48,813 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_hanoi_#res_BEFORE_RETURN_306| Int) (|v_hanoi_#res_BEFORE_RETURN_305| Int) (|v_hanoi_#res_BEFORE_RETURN_307| Int) (|v_hanoi_#res_BEFORE_RETURN_304| Int) (|v_hanoi_#res_BEFORE_RETURN_303| Int)) (and (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_306| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_305|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_305| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_304|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_303| (- 1)) 1) (- 2)) 1) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_304| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_303|) (<= (div (+ (- |c_hanoi_#res|) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_307|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_307| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_306|))) is different from true [2019-12-07 17:05:50,945 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_hanoi_#res_BEFORE_RETURN_306| Int) (|v_hanoi_#res_BEFORE_RETURN_305| Int) (|v_hanoi_#res_BEFORE_RETURN_308| Int) (|v_hanoi_#res_BEFORE_RETURN_307| Int) (|v_hanoi_#res_BEFORE_RETURN_304| Int) (|v_hanoi_#res_BEFORE_RETURN_303| Int)) (and (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_308| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_307|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_306| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_305|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_305| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_304|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_303| (- 1)) 1) (- 2)) 1) (<= |c_hanoi_#t~ret0| |v_hanoi_#res_BEFORE_RETURN_308|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_304| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_303|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_307| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_306|))) is different from true [2019-12-07 17:05:53,100 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_hanoi_#res_BEFORE_RETURN_306| Int) (|v_hanoi_#res_BEFORE_RETURN_305| Int) (|v_hanoi_#res_BEFORE_RETURN_308| Int) (|v_hanoi_#res_BEFORE_RETURN_307| Int) (|v_hanoi_#res_BEFORE_RETURN_304| Int) (|v_hanoi_#res_BEFORE_RETURN_303| Int)) (and (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_308| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_307|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_306| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_305|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_305| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_304|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_303| (- 1)) 1) (- 2)) 1) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_304| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_303|) (<= (div (+ (- |c_hanoi_#res|) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_308|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_307| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_306|))) is different from true [2019-12-07 17:05:55,494 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_hanoi_#res_BEFORE_RETURN_306| Int) (|v_hanoi_#res_BEFORE_RETURN_305| Int) (|v_hanoi_#res_BEFORE_RETURN_308| Int) (|v_hanoi_#res_BEFORE_RETURN_307| Int) (|v_hanoi_#res_BEFORE_RETURN_309| Int) (|v_hanoi_#res_BEFORE_RETURN_304| Int) (|v_hanoi_#res_BEFORE_RETURN_303| Int)) (and (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_308| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_307|) (<= |c_hanoi_#t~ret0| |v_hanoi_#res_BEFORE_RETURN_309|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_306| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_305|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_305| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_304|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_303| (- 1)) 1) (- 2)) 1) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_304| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_303|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_309| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_308|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_307| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_306|))) is different from true [2019-12-07 17:05:57,794 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_hanoi_#res_BEFORE_RETURN_306| Int) (|v_hanoi_#res_BEFORE_RETURN_305| Int) (|v_hanoi_#res_BEFORE_RETURN_308| Int) (|v_hanoi_#res_BEFORE_RETURN_307| Int) (|v_hanoi_#res_BEFORE_RETURN_309| Int) (|v_hanoi_#res_BEFORE_RETURN_304| Int) (|v_hanoi_#res_BEFORE_RETURN_303| Int)) (and (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_308| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_307|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_306| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_305|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_305| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_304|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_303| (- 1)) 1) (- 2)) 1) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_304| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_303|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_309| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_308|) (<= (div (+ (- |c_hanoi_#res|) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_309|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_307| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_306|))) is different from true [2019-12-07 17:06:00,312 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_hanoi_#res_BEFORE_RETURN_306| Int) (|v_hanoi_#res_BEFORE_RETURN_305| Int) (|v_hanoi_#res_BEFORE_RETURN_308| Int) (|v_hanoi_#res_BEFORE_RETURN_307| Int) (|v_hanoi_#res_BEFORE_RETURN_309| Int) (|v_hanoi_#res_BEFORE_RETURN_310| Int) (|v_hanoi_#res_BEFORE_RETURN_304| Int) (|v_hanoi_#res_BEFORE_RETURN_303| Int)) (and (<= |c_hanoi_#t~ret0| |v_hanoi_#res_BEFORE_RETURN_310|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_310| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_309|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_308| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_307|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_306| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_305|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_305| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_304|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_303| (- 1)) 1) (- 2)) 1) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_304| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_303|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_309| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_308|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_307| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_306|))) is different from true [2019-12-07 17:06:02,586 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_hanoi_#res_BEFORE_RETURN_306| Int) (|v_hanoi_#res_BEFORE_RETURN_305| Int) (|v_hanoi_#res_BEFORE_RETURN_308| Int) (|v_hanoi_#res_BEFORE_RETURN_307| Int) (|v_hanoi_#res_BEFORE_RETURN_309| Int) (|v_hanoi_#res_BEFORE_RETURN_310| Int) (|v_hanoi_#res_BEFORE_RETURN_304| Int) (|v_hanoi_#res_BEFORE_RETURN_303| Int)) (and (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_310| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_309|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_308| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_307|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_306| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_305|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_305| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_304|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_303| (- 1)) 1) (- 2)) 1) (<= (div (+ (- |c_hanoi_#res|) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_310|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_304| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_303|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_309| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_308|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_307| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_306|))) is different from true [2019-12-07 17:06:04,904 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_hanoi_#res_BEFORE_RETURN_306| Int) (|v_hanoi_#res_BEFORE_RETURN_305| Int) (|v_hanoi_#res_BEFORE_RETURN_308| Int) (|v_hanoi_#res_BEFORE_RETURN_307| Int) (|v_hanoi_#res_BEFORE_RETURN_309| Int) (|v_hanoi_#res_BEFORE_RETURN_311| Int) (|v_hanoi_#res_BEFORE_RETURN_310| Int) (|v_hanoi_#res_BEFORE_RETURN_304| Int) (|v_hanoi_#res_BEFORE_RETURN_303| Int)) (and (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_310| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_309|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_308| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_307|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_306| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_305|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_305| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_304|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_303| (- 1)) 1) (- 2)) 1) (<= |c_hanoi_#t~ret0| |v_hanoi_#res_BEFORE_RETURN_311|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_304| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_303|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_309| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_308|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_307| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_306|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_311| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_310|))) is different from true [2019-12-07 17:06:07,063 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_hanoi_#res_BEFORE_RETURN_306| Int) (|v_hanoi_#res_BEFORE_RETURN_305| Int) (|v_hanoi_#res_BEFORE_RETURN_308| Int) (|v_hanoi_#res_BEFORE_RETURN_307| Int) (|v_hanoi_#res_BEFORE_RETURN_309| Int) (|v_hanoi_#res_BEFORE_RETURN_311| Int) (|v_hanoi_#res_BEFORE_RETURN_310| Int) (|v_hanoi_#res_BEFORE_RETURN_304| Int) (|v_hanoi_#res_BEFORE_RETURN_303| Int)) (and (<= (div (+ (- |c_hanoi_#res|) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_311|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_310| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_309|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_308| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_307|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_306| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_305|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_305| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_304|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_303| (- 1)) 1) (- 2)) 1) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_304| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_303|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_309| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_308|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_307| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_306|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_311| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_310|))) is different from true [2019-12-07 17:06:09,302 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_hanoi_#res_BEFORE_RETURN_306| Int) (|v_hanoi_#res_BEFORE_RETURN_305| Int) (|v_hanoi_#res_BEFORE_RETURN_308| Int) (|v_hanoi_#res_BEFORE_RETURN_307| Int) (|v_hanoi_#res_BEFORE_RETURN_309| Int) (|v_hanoi_#res_BEFORE_RETURN_311| Int) (|v_hanoi_#res_BEFORE_RETURN_310| Int) (|v_hanoi_#res_BEFORE_RETURN_312| Int) (|v_hanoi_#res_BEFORE_RETURN_304| Int) (|v_hanoi_#res_BEFORE_RETURN_303| Int)) (and (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_312| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_311|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_310| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_309|) (<= |c_hanoi_#t~ret0| |v_hanoi_#res_BEFORE_RETURN_312|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_308| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_307|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_306| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_305|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_305| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_304|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_303| (- 1)) 1) (- 2)) 1) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_304| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_303|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_309| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_308|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_307| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_306|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_311| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_310|))) is different from true [2019-12-07 17:06:14,343 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_hanoi_#res_BEFORE_RETURN_306| Int) (|v_hanoi_#res_BEFORE_RETURN_305| Int) (|v_hanoi_#res_BEFORE_RETURN_308| Int) (|v_hanoi_#res_BEFORE_RETURN_307| Int) (|v_hanoi_#res_BEFORE_RETURN_309| Int) (|v_hanoi_#res_BEFORE_RETURN_311| Int) (|v_hanoi_#res_BEFORE_RETURN_310| Int) (|v_hanoi_#res_BEFORE_RETURN_312| Int) (|v_hanoi_#res_BEFORE_RETURN_304| Int) (|v_hanoi_#res_BEFORE_RETURN_303| Int)) (and (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_312| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_311|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_310| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_309|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_308| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_307|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_306| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_305|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_305| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_304|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_303| (- 1)) 1) (- 2)) 1) (<= (div (+ (- |c_hanoi_#res|) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_312|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_304| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_303|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_309| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_308|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_307| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_306|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_311| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_310|))) is different from true [2019-12-07 17:06:16,885 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_hanoi_#res_BEFORE_RETURN_306| Int) (|v_hanoi_#res_BEFORE_RETURN_305| Int) (|v_hanoi_#res_BEFORE_RETURN_308| Int) (|v_hanoi_#res_BEFORE_RETURN_307| Int) (|v_hanoi_#res_BEFORE_RETURN_309| Int) (|v_hanoi_#res_BEFORE_RETURN_311| Int) (|v_hanoi_#res_BEFORE_RETURN_310| Int) (|v_hanoi_#res_BEFORE_RETURN_313| Int) (|v_hanoi_#res_BEFORE_RETURN_312| Int) (|v_hanoi_#res_BEFORE_RETURN_304| Int) (|v_hanoi_#res_BEFORE_RETURN_303| Int)) (and (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_312| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_311|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_310| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_309|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_308| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_307|) (<= |c_hanoi_#t~ret0| |v_hanoi_#res_BEFORE_RETURN_313|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_306| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_305|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_305| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_304|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_303| (- 1)) 1) (- 2)) 1) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_304| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_303|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_313| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_312|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_309| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_308|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_307| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_306|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_311| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_310|))) is different from true [2019-12-07 17:06:40,907 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_hanoi_#res_BEFORE_RETURN_306| Int) (|v_hanoi_#res_BEFORE_RETURN_305| Int) (|v_hanoi_#res_BEFORE_RETURN_308| Int) (|v_hanoi_#res_BEFORE_RETURN_307| Int) (|v_hanoi_#res_BEFORE_RETURN_309| Int) (|v_hanoi_#res_BEFORE_RETURN_311| Int) (|v_hanoi_#res_BEFORE_RETURN_310| Int) (|v_hanoi_#res_BEFORE_RETURN_313| Int) (|v_hanoi_#res_BEFORE_RETURN_312| Int) (|v_hanoi_#res_BEFORE_RETURN_304| Int) (|v_hanoi_#res_BEFORE_RETURN_303| Int)) (and (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_312| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_311|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_310| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_309|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_308| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_307|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_306| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_305|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_305| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_304|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_303| (- 1)) 1) (- 2)) 1) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_304| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_303|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_313| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_312|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_309| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_308|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_307| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_306|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_311| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_310|) (<= (div (+ (- |c_hanoi_#res|) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_313|))) is different from true [2019-12-07 17:06:43,837 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_hanoi_#res_BEFORE_RETURN_306| Int) (|v_hanoi_#res_BEFORE_RETURN_305| Int) (|v_hanoi_#res_BEFORE_RETURN_308| Int) (|v_hanoi_#res_BEFORE_RETURN_307| Int) (|v_hanoi_#res_BEFORE_RETURN_309| Int) (|v_hanoi_#res_BEFORE_RETURN_311| Int) (|v_hanoi_#res_BEFORE_RETURN_310| Int) (|v_hanoi_#res_BEFORE_RETURN_313| Int) (|v_hanoi_#res_BEFORE_RETURN_312| Int) (|v_hanoi_#res_BEFORE_RETURN_304| Int) (|v_hanoi_#res_BEFORE_RETURN_303| Int) (|v_hanoi_#res_BEFORE_RETURN_314| Int)) (and (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_312| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_311|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_306| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_305|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_304| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_303|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_313| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_312|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_307| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_306|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_311| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_310|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_310| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_309|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_314| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_313|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_308| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_307|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_305| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_304|) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_303| (- 1)) 1) (- 2)) 1) (<= (div (+ (* |v_hanoi_#res_BEFORE_RETURN_309| (- 1)) 1) (- 2)) |v_hanoi_#res_BEFORE_RETURN_308|) (<= |c_hanoi_#t~ret0| |v_hanoi_#res_BEFORE_RETURN_314|))) is different from true [2019-12-07 17:06:49,935 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-12-07 17:06:49,936 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") [2019-12-07 17:06:49,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:06:49,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-12-07 17:06:49,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912809803] [2019-12-07 17:06:49,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-12-07 17:06:49,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:06:49,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-12-07 17:06:49,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=501, Invalid=2514, Unknown=23, NotChecked=2074, Total=5112 [2019-12-07 17:06:49,938 INFO L87 Difference]: Start difference. First operand 343 states and 361 transitions. Second operand 46 states. [2019-12-07 17:06:49,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 17:06:50,139 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:06:50,140 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@40b2f1d4 at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:354) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:202) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:127) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ProtectiveHoareTripleChecker.checkInternal(ProtectiveHoareTripleChecker.java:60) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.EfficientHoareTripleChecker.checkInternal(EfficientHoareTripleChecker.java:62) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:698) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:627) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:454) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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) [2019-12-07 17:06:50,147 INFO L168 Benchmark]: Toolchain (without parser) took 112279.57 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 895.0 MB). Free memory was 949.0 MB in the beginning and 1.6 GB in the end (delta: -611.4 MB). Peak memory consumption was 283.6 MB. Max. memory is 11.5 GB. [2019-12-07 17:06:50,148 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 964.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:06:50,148 INFO L168 Benchmark]: CACSL2BoogieTranslator took 171.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 949.0 MB in the beginning and 1.1 GB in the end (delta: -177.5 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-12-07 17:06:50,148 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.27 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:06:50,148 INFO L168 Benchmark]: Boogie Preprocessor took 11.43 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:06:50,149 INFO L168 Benchmark]: RCFGBuilder took 145.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2019-12-07 17:06:50,149 INFO L168 Benchmark]: TraceAbstraction took 111928.21 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 763.4 MB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -450.9 MB). Peak memory consumption was 312.5 MB. Max. memory is 11.5 GB. [2019-12-07 17:06:50,150 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 964.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 171.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 949.0 MB in the beginning and 1.1 GB in the end (delta: -177.5 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 20.27 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 11.43 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 145.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 111928.21 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 763.4 MB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -450.9 MB). Peak memory consumption was 312.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@40b2f1d4 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@40b2f1d4: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...