./Ultimate.py --spec ../../sv-benchmarks/c/NoOverflows.prp --file ../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_8dd9fc20-56c4-43cf-af64-ed3a7dc6f618/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8dd9fc20-56c4-43cf-af64-ed3a7dc6f618/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8dd9fc20-56c4-43cf-af64-ed3a7dc6f618/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8dd9fc20-56c4-43cf-af64-ed3a7dc6f618/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_8dd9fc20-56c4-43cf-af64-ed3a7dc6f618/bin-2019/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8dd9fc20-56c4-43cf-af64-ed3a7dc6f618/bin-2019/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 ac99a20a7aff68d4303ed37ca9ad8305a1f8cf0d ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 10:12:15,433 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 10:12:15,434 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 10:12:15,440 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 10:12:15,440 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 10:12:15,441 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 10:12:15,442 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 10:12:15,443 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 10:12:15,444 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 10:12:15,445 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 10:12:15,446 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 10:12:15,446 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 10:12:15,446 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 10:12:15,447 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 10:12:15,447 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 10:12:15,448 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 10:12:15,448 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 10:12:15,449 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 10:12:15,450 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 10:12:15,451 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 10:12:15,452 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 10:12:15,452 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 10:12:15,453 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 10:12:15,453 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 10:12:15,454 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 10:12:15,454 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 10:12:15,454 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 10:12:15,455 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 10:12:15,455 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 10:12:15,456 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 10:12:15,456 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 10:12:15,457 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 10:12:15,457 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 10:12:15,457 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 10:12:15,458 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 10:12:15,458 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 10:12:15,459 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8dd9fc20-56c4-43cf-af64-ed3a7dc6f618/bin-2019/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf [2018-11-10 10:12:15,465 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 10:12:15,466 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 10:12:15,466 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 10:12:15,466 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 10:12:15,467 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 10:12:15,467 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 10:12:15,467 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 10:12:15,467 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 10:12:15,467 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 10:12:15,467 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 10:12:15,467 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 10:12:15,468 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 10:12:15,468 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 10:12:15,468 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 10:12:15,468 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-10 10:12:15,468 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 10:12:15,468 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 10:12:15,468 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 10:12:15,469 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 10:12:15,469 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 10:12:15,469 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 10:12:15,469 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 10:12:15,469 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 10:12:15,469 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 10:12:15,469 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 10:12:15,470 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 10:12:15,470 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 10:12:15,470 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 10:12:15,470 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_8dd9fc20-56c4-43cf-af64-ed3a7dc6f618/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> ac99a20a7aff68d4303ed37ca9ad8305a1f8cf0d [2018-11-10 10:12:15,494 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 10:12:15,504 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 10:12:15,506 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 10:12:15,507 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 10:12:15,508 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 10:12:15,508 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8dd9fc20-56c4-43cf-af64-ed3a7dc6f618/bin-2019/uautomizer/../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c [2018-11-10 10:12:15,554 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8dd9fc20-56c4-43cf-af64-ed3a7dc6f618/bin-2019/uautomizer/data/c25e4077c/2e8558607117417981cad23eb9236ae9/FLAG99a4ff491 [2018-11-10 10:12:15,964 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 10:12:15,964 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8dd9fc20-56c4-43cf-af64-ed3a7dc6f618/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c [2018-11-10 10:12:15,968 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8dd9fc20-56c4-43cf-af64-ed3a7dc6f618/bin-2019/uautomizer/data/c25e4077c/2e8558607117417981cad23eb9236ae9/FLAG99a4ff491 [2018-11-10 10:12:15,979 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8dd9fc20-56c4-43cf-af64-ed3a7dc6f618/bin-2019/uautomizer/data/c25e4077c/2e8558607117417981cad23eb9236ae9 [2018-11-10 10:12:15,982 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 10:12:15,983 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 10:12:15,983 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 10:12:15,984 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 10:12:15,986 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 10:12:15,986 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:12:15" (1/1) ... [2018-11-10 10:12:15,988 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73286d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:12:15, skipping insertion in model container [2018-11-10 10:12:15,988 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:12:15" (1/1) ... [2018-11-10 10:12:15,995 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 10:12:16,006 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 10:12:16,105 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:12:16,108 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 10:12:16,119 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:12:16,127 INFO L193 MainTranslator]: Completed translation [2018-11-10 10:12:16,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:12:16 WrapperNode [2018-11-10 10:12:16,127 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 10:12:16,128 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 10:12:16,128 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 10:12:16,128 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 10:12:16,135 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:12:16" (1/1) ... [2018-11-10 10:12:16,135 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:12:16" (1/1) ... [2018-11-10 10:12:16,138 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:12:16" (1/1) ... [2018-11-10 10:12:16,139 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:12:16" (1/1) ... [2018-11-10 10:12:16,140 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:12:16" (1/1) ... [2018-11-10 10:12:16,143 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:12:16" (1/1) ... [2018-11-10 10:12:16,144 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:12:16" (1/1) ... [2018-11-10 10:12:16,145 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 10:12:16,145 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 10:12:16,145 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 10:12:16,145 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 10:12:16,145 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:12:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8dd9fc20-56c4-43cf-af64-ed3a7dc6f618/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 10:12:16,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 10:12:16,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 10:12:16,213 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 10:12:16,214 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-10 10:12:16,214 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 10:12:16,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 10:12:16,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 10:12:16,328 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 10:12:16,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:12:16 BoogieIcfgContainer [2018-11-10 10:12:16,329 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 10:12:16,329 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 10:12:16,330 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 10:12:16,331 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 10:12:16,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 10:12:15" (1/3) ... [2018-11-10 10:12:16,332 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2008d717 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:12:16, skipping insertion in model container [2018-11-10 10:12:16,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:12:16" (2/3) ... [2018-11-10 10:12:16,333 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2008d717 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:12:16, skipping insertion in model container [2018-11-10 10:12:16,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:12:16" (3/3) ... [2018-11-10 10:12:16,334 INFO L112 eAbstractionObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c [2018-11-10 10:12:16,342 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 10:12:16,348 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2018-11-10 10:12:16,359 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2018-11-10 10:12:16,378 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 10:12:16,379 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 10:12:16,379 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 10:12:16,379 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 10:12:16,379 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 10:12:16,379 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 10:12:16,380 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 10:12:16,380 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 10:12:16,380 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 10:12:16,392 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-11-10 10:12:16,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-10 10:12:16,395 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:12:16,396 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:12:16,398 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 10:12:16,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:12:16,403 INFO L82 PathProgramCache]: Analyzing trace with hash -2024263192, now seen corresponding path program 1 times [2018-11-10 10:12:16,404 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:12:16,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:12:16,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:12:16,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:12:16,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:12:16,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:12:16,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:12:16,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:12:16,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 10:12:16,486 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 10:12:16,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 10:12:16,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 10:12:16,495 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2018-11-10 10:12:16,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:12:16,507 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2018-11-10 10:12:16,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 10:12:16,508 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-10 10:12:16,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:12:16,514 INFO L225 Difference]: With dead ends: 62 [2018-11-10 10:12:16,514 INFO L226 Difference]: Without dead ends: 29 [2018-11-10 10:12:16,517 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 10:12:16,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-10 10:12:16,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-10 10:12:16,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-10 10:12:16,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-11-10 10:12:16,540 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 10 [2018-11-10 10:12:16,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:12:16,540 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-11-10 10:12:16,540 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 10:12:16,540 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-11-10 10:12:16,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-10 10:12:16,540 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:12:16,540 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:12:16,541 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 10:12:16,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:12:16,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1672316879, now seen corresponding path program 1 times [2018-11-10 10:12:16,541 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:12:16,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:12:16,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:12:16,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:12:16,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:12:16,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:12:16,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:12:16,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:12:16,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 10:12:16,577 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:12:16,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:12:16,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:12:16,578 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 3 states. [2018-11-10 10:12:16,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:12:16,614 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-11-10 10:12:16,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:12:16,615 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-10 10:12:16,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:12:16,615 INFO L225 Difference]: With dead ends: 51 [2018-11-10 10:12:16,616 INFO L226 Difference]: Without dead ends: 50 [2018-11-10 10:12:16,616 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:12:16,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-10 10:12:16,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 34. [2018-11-10 10:12:16,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-10 10:12:16,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-11-10 10:12:16,620 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 11 [2018-11-10 10:12:16,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:12:16,620 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2018-11-10 10:12:16,620 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:12:16,621 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-10 10:12:16,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-10 10:12:16,621 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:12:16,621 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:12:16,621 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 10:12:16,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:12:16,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1672316912, now seen corresponding path program 1 times [2018-11-10 10:12:16,622 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:12:16,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:12:16,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:12:16,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:12:16,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:12:16,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:12:16,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:12:16,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:12:16,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 10:12:16,645 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:12:16,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:12:16,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:12:16,645 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 3 states. [2018-11-10 10:12:16,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:12:16,677 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2018-11-10 10:12:16,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:12:16,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-10 10:12:16,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:12:16,678 INFO L225 Difference]: With dead ends: 45 [2018-11-10 10:12:16,678 INFO L226 Difference]: Without dead ends: 44 [2018-11-10 10:12:16,678 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:12:16,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-10 10:12:16,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2018-11-10 10:12:16,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-10 10:12:16,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-11-10 10:12:16,681 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 11 [2018-11-10 10:12:16,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:12:16,681 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-10 10:12:16,681 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:12:16,681 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-10 10:12:16,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-10 10:12:16,682 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:12:16,682 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:12:16,682 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 10:12:16,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:12:16,682 INFO L82 PathProgramCache]: Analyzing trace with hash 302215787, now seen corresponding path program 1 times [2018-11-10 10:12:16,682 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:12:16,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:12:16,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:12:16,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:12:16,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:12:16,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:12:16,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:12:16,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:12:16,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 10:12:16,705 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:12:16,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:12:16,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:12:16,706 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 3 states. [2018-11-10 10:12:16,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:12:16,737 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2018-11-10 10:12:16,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:12:16,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-11-10 10:12:16,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:12:16,738 INFO L225 Difference]: With dead ends: 58 [2018-11-10 10:12:16,738 INFO L226 Difference]: Without dead ends: 57 [2018-11-10 10:12:16,738 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:12:16,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-10 10:12:16,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 43. [2018-11-10 10:12:16,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-10 10:12:16,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2018-11-10 10:12:16,742 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 12 [2018-11-10 10:12:16,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:12:16,742 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2018-11-10 10:12:16,743 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:12:16,743 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2018-11-10 10:12:16,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-10 10:12:16,743 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:12:16,743 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:12:16,744 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 10:12:16,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:12:16,744 INFO L82 PathProgramCache]: Analyzing trace with hash 302216781, now seen corresponding path program 1 times [2018-11-10 10:12:16,744 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:12:16,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:12:16,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:12:16,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:12:16,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:12:16,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:12:16,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:12:16,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:12:16,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 10:12:16,767 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:12:16,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:12:16,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:12:16,768 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 3 states. [2018-11-10 10:12:16,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:12:16,792 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2018-11-10 10:12:16,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:12:16,793 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-11-10 10:12:16,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:12:16,793 INFO L225 Difference]: With dead ends: 43 [2018-11-10 10:12:16,794 INFO L226 Difference]: Without dead ends: 42 [2018-11-10 10:12:16,794 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:12:16,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-10 10:12:16,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-10 10:12:16,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-10 10:12:16,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2018-11-10 10:12:16,798 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 12 [2018-11-10 10:12:16,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:12:16,798 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2018-11-10 10:12:16,798 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:12:16,798 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-11-10 10:12:16,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-10 10:12:16,799 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:12:16,799 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:12:16,799 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 10:12:16,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:12:16,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1627447504, now seen corresponding path program 1 times [2018-11-10 10:12:16,799 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:12:16,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:12:16,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:12:16,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:12:16,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:12:16,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:12:16,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:12:16,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:12:16,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 10:12:16,822 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:12:16,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:12:16,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:12:16,822 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 3 states. [2018-11-10 10:12:16,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:12:16,835 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2018-11-10 10:12:16,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:12:16,836 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-10 10:12:16,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:12:16,836 INFO L225 Difference]: With dead ends: 42 [2018-11-10 10:12:16,837 INFO L226 Difference]: Without dead ends: 41 [2018-11-10 10:12:16,837 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:12:16,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-10 10:12:16,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-10 10:12:16,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-10 10:12:16,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2018-11-10 10:12:16,841 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 14 [2018-11-10 10:12:16,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:12:16,841 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-11-10 10:12:16,841 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:12:16,841 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2018-11-10 10:12:16,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-10 10:12:16,841 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:12:16,842 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:12:16,842 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 10:12:16,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:12:16,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1088734998, now seen corresponding path program 1 times [2018-11-10 10:12:16,842 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:12:16,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:12:16,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:12:16,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:12:16,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:12:16,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:12:16,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:12:16,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:12:16,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 10:12:16,862 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:12:16,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:12:16,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:12:16,863 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 3 states. [2018-11-10 10:12:16,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:12:16,878 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2018-11-10 10:12:16,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:12:16,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-10 10:12:16,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:12:16,879 INFO L225 Difference]: With dead ends: 41 [2018-11-10 10:12:16,879 INFO L226 Difference]: Without dead ends: 40 [2018-11-10 10:12:16,879 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:12:16,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-10 10:12:16,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-10 10:12:16,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-10 10:12:16,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2018-11-10 10:12:16,884 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 15 [2018-11-10 10:12:16,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:12:16,884 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2018-11-10 10:12:16,884 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:12:16,885 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2018-11-10 10:12:16,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-10 10:12:16,885 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:12:16,885 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:12:16,886 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 10:12:16,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:12:16,886 INFO L82 PathProgramCache]: Analyzing trace with hash -113098749, now seen corresponding path program 1 times [2018-11-10 10:12:16,886 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:12:16,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:12:16,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:12:16,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:12:16,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:12:16,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:12:16,924 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:12:16,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:12:16,924 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8dd9fc20-56c4-43cf-af64-ed3a7dc6f618/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:12:16,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:12:16,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:12:16,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:12:16,973 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:12:16,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:12:16,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-11-10 10:12:16,992 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:12:16,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:12:16,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:12:16,992 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 4 states. [2018-11-10 10:12:17,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:12:17,016 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2018-11-10 10:12:17,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:12:17,016 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-11-10 10:12:17,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:12:17,017 INFO L225 Difference]: With dead ends: 70 [2018-11-10 10:12:17,017 INFO L226 Difference]: Without dead ends: 69 [2018-11-10 10:12:17,017 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:12:17,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-10 10:12:17,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 46. [2018-11-10 10:12:17,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-10 10:12:17,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2018-11-10 10:12:17,022 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 17 [2018-11-10 10:12:17,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:12:17,022 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2018-11-10 10:12:17,022 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:12:17,022 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2018-11-10 10:12:17,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-10 10:12:17,022 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:12:17,023 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:12:17,023 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 10:12:17,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:12:17,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1697684744, now seen corresponding path program 1 times [2018-11-10 10:12:17,023 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:12:17,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:12:17,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:12:17,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:12:17,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:12:17,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:12:17,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:12:17,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:12:17,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:12:17,056 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:12:17,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:12:17,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:12:17,056 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 4 states. [2018-11-10 10:12:17,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:12:17,090 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2018-11-10 10:12:17,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:12:17,091 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-11-10 10:12:17,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:12:17,092 INFO L225 Difference]: With dead ends: 46 [2018-11-10 10:12:17,092 INFO L226 Difference]: Without dead ends: 45 [2018-11-10 10:12:17,093 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:12:17,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-10 10:12:17,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-11-10 10:12:17,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-10 10:12:17,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2018-11-10 10:12:17,098 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 17 [2018-11-10 10:12:17,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:12:17,098 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2018-11-10 10:12:17,098 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:12:17,099 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2018-11-10 10:12:17,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-10 10:12:17,099 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:12:17,099 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:12:17,099 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 10:12:17,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:12:17,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1088619433, now seen corresponding path program 1 times [2018-11-10 10:12:17,100 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:12:17,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:12:17,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:12:17,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:12:17,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:12:17,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:12:17,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:12:17,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:12:17,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:12:17,128 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:12:17,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:12:17,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:12:17,129 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand 4 states. [2018-11-10 10:12:17,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:12:17,181 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2018-11-10 10:12:17,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:12:17,181 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-11-10 10:12:17,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:12:17,182 INFO L225 Difference]: With dead ends: 48 [2018-11-10 10:12:17,182 INFO L226 Difference]: Without dead ends: 46 [2018-11-10 10:12:17,182 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:12:17,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-10 10:12:17,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 37. [2018-11-10 10:12:17,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-10 10:12:17,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2018-11-10 10:12:17,186 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 18 [2018-11-10 10:12:17,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:12:17,186 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2018-11-10 10:12:17,186 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:12:17,186 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2018-11-10 10:12:17,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-10 10:12:17,187 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:12:17,187 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:12:17,187 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 10:12:17,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:12:17,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1807051700, now seen corresponding path program 1 times [2018-11-10 10:12:17,188 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:12:17,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:12:17,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:12:17,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:12:17,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:12:17,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:12:17,241 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 10:12:17,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:12:17,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:12:17,242 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:12:17,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:12:17,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:12:17,243 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand 4 states. [2018-11-10 10:12:17,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:12:17,289 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2018-11-10 10:12:17,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 10:12:17,289 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-11-10 10:12:17,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:12:17,290 INFO L225 Difference]: With dead ends: 70 [2018-11-10 10:12:17,290 INFO L226 Difference]: Without dead ends: 69 [2018-11-10 10:12:17,290 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:12:17,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-10 10:12:17,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 47. [2018-11-10 10:12:17,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-10 10:12:17,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2018-11-10 10:12:17,295 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 20 [2018-11-10 10:12:17,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:12:17,295 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2018-11-10 10:12:17,295 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:12:17,295 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2018-11-10 10:12:17,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-10 10:12:17,295 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:12:17,296 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:12:17,296 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 10:12:17,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:12:17,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1807051733, now seen corresponding path program 1 times [2018-11-10 10:12:17,296 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:12:17,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:12:17,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:12:17,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:12:17,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:12:17,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:12:17,315 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:12:17,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:12:17,316 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8dd9fc20-56c4-43cf-af64-ed3a7dc6f618/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:12:17,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:12:17,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:12:17,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:12:17,334 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:12:17,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:12:17,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-11-10 10:12:17,350 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:12:17,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:12:17,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:12:17,351 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand 4 states. [2018-11-10 10:12:17,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:12:17,367 INFO L93 Difference]: Finished difference Result 82 states and 95 transitions. [2018-11-10 10:12:17,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:12:17,367 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-11-10 10:12:17,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:12:17,368 INFO L225 Difference]: With dead ends: 82 [2018-11-10 10:12:17,368 INFO L226 Difference]: Without dead ends: 81 [2018-11-10 10:12:17,368 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:12:17,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-10 10:12:17,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 67. [2018-11-10 10:12:17,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-10 10:12:17,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2018-11-10 10:12:17,375 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 20 [2018-11-10 10:12:17,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:12:17,375 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2018-11-10 10:12:17,375 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:12:17,375 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2018-11-10 10:12:17,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 10:12:17,376 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:12:17,376 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:12:17,377 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 10:12:17,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:12:17,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1227948343, now seen corresponding path program 2 times [2018-11-10 10:12:17,377 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:12:17,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:12:17,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:12:17,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:12:17,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:12:17,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:12:17,416 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:12:17,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:12:17,417 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8dd9fc20-56c4-43cf-af64-ed3a7dc6f618/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:12:17,431 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 10:12:17,443 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-10 10:12:17,443 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 10:12:17,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:12:17,490 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-10 10:12:17,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:12:17,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-11-10 10:12:17,508 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:12:17,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:12:17,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:12:17,509 INFO L87 Difference]: Start difference. First operand 67 states and 79 transitions. Second operand 7 states. [2018-11-10 10:12:17,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:12:17,618 INFO L93 Difference]: Finished difference Result 104 states and 121 transitions. [2018-11-10 10:12:17,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:12:17,618 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-11-10 10:12:17,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:12:17,619 INFO L225 Difference]: With dead ends: 104 [2018-11-10 10:12:17,619 INFO L226 Difference]: Without dead ends: 103 [2018-11-10 10:12:17,620 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-11-10 10:12:17,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-10 10:12:17,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 61. [2018-11-10 10:12:17,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-10 10:12:17,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2018-11-10 10:12:17,627 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 23 [2018-11-10 10:12:17,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:12:17,628 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2018-11-10 10:12:17,628 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:12:17,628 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2018-11-10 10:12:17,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 10:12:17,629 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:12:17,629 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:12:17,632 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 10:12:17,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:12:17,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1155182080, now seen corresponding path program 1 times [2018-11-10 10:12:17,632 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:12:17,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:12:17,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:12:17,633 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:12:17,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:12:17,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:12:17,665 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:12:17,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:12:17,666 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8dd9fc20-56c4-43cf-af64-ed3a7dc6f618/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:12:17,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:12:17,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:12:17,686 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:12:17,696 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:12:17,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:12:17,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-10 10:12:17,714 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 10:12:17,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 10:12:17,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 10:12:17,715 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand 6 states. [2018-11-10 10:12:17,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:12:17,775 INFO L93 Difference]: Finished difference Result 103 states and 120 transitions. [2018-11-10 10:12:17,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 10:12:17,775 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-11-10 10:12:17,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:12:17,776 INFO L225 Difference]: With dead ends: 103 [2018-11-10 10:12:17,776 INFO L226 Difference]: Without dead ends: 61 [2018-11-10 10:12:17,776 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-10 10:12:17,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-10 10:12:17,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-11-10 10:12:17,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-10 10:12:17,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2018-11-10 10:12:17,781 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 26 [2018-11-10 10:12:17,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:12:17,781 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2018-11-10 10:12:17,781 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 10:12:17,782 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2018-11-10 10:12:17,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 10:12:17,782 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:12:17,782 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:12:17,783 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 10:12:17,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:12:17,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1936373826, now seen corresponding path program 1 times [2018-11-10 10:12:17,783 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:12:17,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:12:17,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:12:17,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:12:17,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:12:17,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:12:17,821 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:12:17,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:12:17,821 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8dd9fc20-56c4-43cf-af64-ed3a7dc6f618/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:12:17,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:12:17,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:12:17,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:12:17,905 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:12:17,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:12:17,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2018-11-10 10:12:17,923 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 10:12:17,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 10:12:17,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-11-10 10:12:17,923 INFO L87 Difference]: Start difference. First operand 61 states and 70 transitions. Second operand 10 states. [2018-11-10 10:12:18,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:12:18,120 INFO L93 Difference]: Finished difference Result 222 states and 254 transitions. [2018-11-10 10:12:18,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-10 10:12:18,121 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2018-11-10 10:12:18,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:12:18,122 INFO L225 Difference]: With dead ends: 222 [2018-11-10 10:12:18,122 INFO L226 Difference]: Without dead ends: 221 [2018-11-10 10:12:18,122 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=206, Invalid=394, Unknown=0, NotChecked=0, Total=600 [2018-11-10 10:12:18,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-11-10 10:12:18,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 115. [2018-11-10 10:12:18,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-10 10:12:18,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 134 transitions. [2018-11-10 10:12:18,132 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 134 transitions. Word has length 26 [2018-11-10 10:12:18,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:12:18,133 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 134 transitions. [2018-11-10 10:12:18,133 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 10:12:18,133 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 134 transitions. [2018-11-10 10:12:18,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-10 10:12:18,134 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:12:18,139 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:12:18,140 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 10:12:18,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:12:18,141 INFO L82 PathProgramCache]: Analyzing trace with hash 546249104, now seen corresponding path program 2 times [2018-11-10 10:12:18,141 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:12:18,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:12:18,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:12:18,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:12:18,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:12:18,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:12:18,166 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:12:18,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:12:18,167 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8dd9fc20-56c4-43cf-af64-ed3a7dc6f618/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:12:18,180 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 10:12:18,186 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-10 10:12:18,187 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 10:12:18,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:12:18,201 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 10:12:18,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:12:18,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-11-10 10:12:18,218 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:12:18,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:12:18,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:12:18,218 INFO L87 Difference]: Start difference. First operand 115 states and 134 transitions. Second operand 7 states. [2018-11-10 10:12:18,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:12:18,271 INFO L93 Difference]: Finished difference Result 233 states and 272 transitions. [2018-11-10 10:12:18,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:12:18,272 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-11-10 10:12:18,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:12:18,273 INFO L225 Difference]: With dead ends: 233 [2018-11-10 10:12:18,273 INFO L226 Difference]: Without dead ends: 232 [2018-11-10 10:12:18,273 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-11-10 10:12:18,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-11-10 10:12:18,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 70. [2018-11-10 10:12:18,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-10 10:12:18,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2018-11-10 10:12:18,287 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 29 [2018-11-10 10:12:18,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:12:18,287 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2018-11-10 10:12:18,287 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:12:18,287 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2018-11-10 10:12:18,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-10 10:12:18,288 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:12:18,288 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:12:18,289 INFO L424 AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 10:12:18,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:12:18,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1525031015, now seen corresponding path program 1 times [2018-11-10 10:12:18,289 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:12:18,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:12:18,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:12:18,290 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:12:18,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:12:18,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:12:18,344 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 10:12:18,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:12:18,344 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8dd9fc20-56c4-43cf-af64-ed3a7dc6f618/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:12:18,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:12:18,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:12:18,368 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:12:18,375 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 10:12:18,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:12:18,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-11-10 10:12:18,403 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 10:12:18,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 10:12:18,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-10 10:12:18,403 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. Second operand 9 states. [2018-11-10 10:12:18,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:12:18,551 INFO L93 Difference]: Finished difference Result 186 states and 208 transitions. [2018-11-10 10:12:18,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-10 10:12:18,552 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 47 [2018-11-10 10:12:18,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:12:18,552 INFO L225 Difference]: With dead ends: 186 [2018-11-10 10:12:18,553 INFO L226 Difference]: Without dead ends: 185 [2018-11-10 10:12:18,553 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=138, Invalid=242, Unknown=0, NotChecked=0, Total=380 [2018-11-10 10:12:18,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-11-10 10:12:18,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 76. [2018-11-10 10:12:18,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-10 10:12:18,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2018-11-10 10:12:18,561 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 47 [2018-11-10 10:12:18,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:12:18,561 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2018-11-10 10:12:18,561 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 10:12:18,561 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2018-11-10 10:12:18,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-10 10:12:18,562 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:12:18,562 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:12:18,562 INFO L424 AbstractCegarLoop]: === Iteration 18 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 10:12:18,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:12:18,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1322840547, now seen corresponding path program 2 times [2018-11-10 10:12:18,563 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:12:18,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:12:18,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:12:18,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:12:18,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:12:18,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:12:18,629 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 10:12:18,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:12:18,630 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8dd9fc20-56c4-43cf-af64-ed3a7dc6f618/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:12:18,641 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 10:12:18,652 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 10:12:18,652 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 10:12:18,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:12:18,661 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 10:12:18,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:12:18,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-11-10 10:12:18,681 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 10:12:18,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 10:12:18,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-10 10:12:18,681 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand 10 states. [2018-11-10 10:12:18,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:12:18,859 INFO L93 Difference]: Finished difference Result 205 states and 229 transitions. [2018-11-10 10:12:18,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-10 10:12:18,859 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2018-11-10 10:12:18,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:12:18,860 INFO L225 Difference]: With dead ends: 205 [2018-11-10 10:12:18,860 INFO L226 Difference]: Without dead ends: 204 [2018-11-10 10:12:18,861 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=196, Invalid=356, Unknown=0, NotChecked=0, Total=552 [2018-11-10 10:12:18,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-11-10 10:12:18,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 82. [2018-11-10 10:12:18,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-10 10:12:18,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2018-11-10 10:12:18,869 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 53 [2018-11-10 10:12:18,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:12:18,870 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2018-11-10 10:12:18,870 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 10:12:18,870 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2018-11-10 10:12:18,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-10 10:12:18,870 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:12:18,870 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:12:18,871 INFO L424 AbstractCegarLoop]: === Iteration 19 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 10:12:18,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:12:18,871 INFO L82 PathProgramCache]: Analyzing trace with hash 482946250, now seen corresponding path program 3 times [2018-11-10 10:12:18,871 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:12:18,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:12:18,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:12:18,872 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:12:18,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:12:18,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:12:18,906 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 10:12:18,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:12:18,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 10:12:18,907 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 10:12:18,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 10:12:18,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 10:12:18,907 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand 6 states. [2018-11-10 10:12:18,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:12:18,979 INFO L93 Difference]: Finished difference Result 192 states and 217 transitions. [2018-11-10 10:12:18,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 10:12:18,983 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2018-11-10 10:12:18,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:12:18,984 INFO L225 Difference]: With dead ends: 192 [2018-11-10 10:12:18,984 INFO L226 Difference]: Without dead ends: 135 [2018-11-10 10:12:18,985 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-11-10 10:12:18,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-11-10 10:12:18,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 96. [2018-11-10 10:12:18,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-10 10:12:18,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2018-11-10 10:12:18,995 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 56 [2018-11-10 10:12:18,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:12:18,995 INFO L481 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2018-11-10 10:12:18,995 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 10:12:18,996 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2018-11-10 10:12:18,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-10 10:12:18,996 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:12:18,996 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:12:18,996 INFO L424 AbstractCegarLoop]: === Iteration 20 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 10:12:18,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:12:18,997 INFO L82 PathProgramCache]: Analyzing trace with hash 625652574, now seen corresponding path program 4 times [2018-11-10 10:12:18,997 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:12:18,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:12:18,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:12:18,998 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:12:18,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:12:19,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:12:19,056 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 10:12:19,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:12:19,056 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8dd9fc20-56c4-43cf-af64-ed3a7dc6f618/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:12:19,064 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 10:12:19,080 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 10:12:19,080 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 10:12:19,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:12:19,117 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-10 10:12:19,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:12:19,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 12 [2018-11-10 10:12:19,134 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 10:12:19,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 10:12:19,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-11-10 10:12:19,135 INFO L87 Difference]: Start difference. First operand 96 states and 105 transitions. Second operand 13 states. [2018-11-10 10:12:19,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:12:19,336 INFO L93 Difference]: Finished difference Result 207 states and 224 transitions. [2018-11-10 10:12:19,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-10 10:12:19,336 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 56 [2018-11-10 10:12:19,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:12:19,337 INFO L225 Difference]: With dead ends: 207 [2018-11-10 10:12:19,337 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 10:12:19,338 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=276, Invalid=536, Unknown=0, NotChecked=0, Total=812 [2018-11-10 10:12:19,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 10:12:19,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 10:12:19,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 10:12:19,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 10:12:19,338 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 56 [2018-11-10 10:12:19,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:12:19,339 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 10:12:19,339 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 10:12:19,339 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 10:12:19,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 10:12:19,343 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 10:12:19,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:12:19,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:12:19,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:12:19,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:12:19,462 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 126 [2018-11-10 10:12:19,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:12:19,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:12:19,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:12:19,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:12:19,474 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:12:19,566 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:12:19,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:12:19,568 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:12:19,602 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:12:19,620 WARN L179 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 128 [2018-11-10 10:12:19,623 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:12:19,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:12:19,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:12:19,626 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:12:19,627 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:12:19,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:12:19,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:12:19,643 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:12:19,666 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:12:19,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:12:19,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:12:19,669 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:12:19,669 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:12:20,060 WARN L179 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 36 [2018-11-10 10:12:20,353 WARN L179 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 28 [2018-11-10 10:12:20,473 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 26 [2018-11-10 10:12:20,474 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-10 10:12:20,475 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 10:12:20,475 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 10:12:20,475 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 10:12:20,475 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 10:12:20,475 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 10:12:20,475 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 13 37) no Hoare annotation was computed. [2018-11-10 10:12:20,475 INFO L425 ceAbstractionStarter]: For program point L23-1(lines 23 34) no Hoare annotation was computed. [2018-11-10 10:12:20,475 INFO L421 ceAbstractionStarter]: At program point L23-3(lines 23 34) the Hoare annotation is: (let ((.cse1 (<= 0 main_~i~0)) (.cse5 (<= 0 main_~j~0)) (.cse0 (<= main_~n~0 2147483647)) (.cse6 (<= main_~m~0 main_~j~0)) (.cse2 (<= main_~N~0 2147483647)) (.cse3 (<= 0 main_~N~0)) (.cse4 (<= main_~m~0 2147483647))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= main_~i~0 0)) (and .cse5 .cse0 .cse1 .cse6 .cse2 .cse3 (<= main_~j~0 0)) (and (<= main_~N~0 (+ main_~k~0 1)) (and .cse5 .cse0 .cse6 .cse2 .cse3 .cse4) (<= main_~N~0 main_~i~0)))) [2018-11-10 10:12:20,475 INFO L425 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) no Hoare annotation was computed. [2018-11-10 10:12:20,475 INFO L425 ceAbstractionStarter]: For program point L28-1(lines 28 30) no Hoare annotation was computed. [2018-11-10 10:12:20,475 INFO L425 ceAbstractionStarter]: For program point L28-2(line 28) no Hoare annotation was computed. [2018-11-10 10:12:20,475 INFO L425 ceAbstractionStarter]: For program point L28-3(lines 28 30) no Hoare annotation was computed. [2018-11-10 10:12:20,475 INFO L425 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2018-11-10 10:12:20,476 INFO L421 ceAbstractionStarter]: At program point L28-5(lines 28 30) the Hoare annotation is: (let ((.cse0 (and (and (<= 0 main_~j~0) (<= main_~n~0 2147483647) (<= 0 main_~i~0) (<= 0 main_~k~0) (<= main_~N~0 2147483647) (<= 0 main_~N~0) (<= main_~k~0 2147483646)) (<= main_~m~0 2147483647)))) (or (and .cse0 (<= main_~i~0 0)) (and .cse0 (<= main_~N~0 (+ main_~k~0 1)) (<= main_~N~0 (+ main_~i~0 1))))) [2018-11-10 10:12:20,476 INFO L425 ceAbstractionStarter]: For program point L28-6(lines 28 30) no Hoare annotation was computed. [2018-11-10 10:12:20,476 INFO L425 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 33) no Hoare annotation was computed. [2018-11-10 10:12:20,476 INFO L425 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) no Hoare annotation was computed. [2018-11-10 10:12:20,476 INFO L425 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2018-11-10 10:12:20,476 INFO L425 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2018-11-10 10:12:20,476 INFO L425 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2018-11-10 10:12:20,476 INFO L425 ceAbstractionStarter]: For program point L29-1(line 29) no Hoare annotation was computed. [2018-11-10 10:12:20,476 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2018-11-10 10:12:20,476 INFO L425 ceAbstractionStarter]: For program point L25-1(lines 25 32) no Hoare annotation was computed. [2018-11-10 10:12:20,476 INFO L421 ceAbstractionStarter]: At program point L25-3(lines 25 32) the Hoare annotation is: (let ((.cse4 (<= 0 main_~j~0)) (.cse5 (<= main_~n~0 2147483647)) (.cse6 (<= 0 main_~i~0)) (.cse7 (<= main_~N~0 2147483647)) (.cse9 (<= main_~i~0 2147483646)) (.cse8 (<= 0 main_~N~0))) (let ((.cse3 (<= main_~N~0 (+ main_~k~0 1))) (.cse0 (<= main_~m~0 2147483647)) (.cse2 (and .cse4 .cse5 .cse6 .cse7 .cse9 .cse8)) (.cse1 (<= main_~j~0 0))) (or (and (and .cse0 .cse1 .cse2) .cse3 (<= main_~N~0 main_~i~0)) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse0 .cse1 (<= main_~i~0 0)) (and .cse3 (and (and .cse4 .cse5 .cse6 (<= 0 main_~k~0) .cse9 .cse8 (<= main_~k~0 2147483646)) .cse0) (<= main_~N~0 (+ main_~i~0 1))) (and (<= main_~m~0 0) .cse2 .cse1)))) [2018-11-10 10:12:20,476 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 35) no Hoare annotation was computed. [2018-11-10 10:12:20,476 INFO L425 ceAbstractionStarter]: For program point L25-4(lines 25 32) no Hoare annotation was computed. [2018-11-10 10:12:20,476 INFO L425 ceAbstractionStarter]: For program point L21-1(lines 21 35) no Hoare annotation was computed. [2018-11-10 10:12:20,476 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 13 37) no Hoare annotation was computed. [2018-11-10 10:12:20,476 INFO L425 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 33) no Hoare annotation was computed. [2018-11-10 10:12:20,477 INFO L425 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2018-11-10 10:12:20,477 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 13 37) the Hoare annotation is: true [2018-11-10 10:12:20,477 INFO L425 ceAbstractionStarter]: For program point L26(line 26) no Hoare annotation was computed. [2018-11-10 10:12:20,477 INFO L425 ceAbstractionStarter]: For program point L26-1(line 26) no Hoare annotation was computed. [2018-11-10 10:12:20,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 10:12:20 BoogieIcfgContainer [2018-11-10 10:12:20,488 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 10:12:20,488 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 10:12:20,488 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 10:12:20,488 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 10:12:20,489 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:12:16" (3/4) ... [2018-11-10 10:12:20,492 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 10:12:20,499 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 10:12:20,500 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 10:12:20,503 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2018-11-10 10:12:20,503 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-11-10 10:12:20,503 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 10:12:20,503 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 10:12:20,540 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_8dd9fc20-56c4-43cf-af64-ed3a7dc6f618/bin-2019/uautomizer/witness.graphml [2018-11-10 10:12:20,540 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 10:12:20,541 INFO L168 Benchmark]: Toolchain (without parser) took 4559.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 175.1 MB). Free memory was 963.0 MB in the beginning and 1.1 GB in the end (delta: -101.2 MB). Peak memory consumption was 73.9 MB. Max. memory is 11.5 GB. [2018-11-10 10:12:20,542 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:12:20,542 INFO L168 Benchmark]: CACSL2BoogieTranslator took 144.25 ms. Allocated memory is still 1.0 GB. Free memory was 963.0 MB in the beginning and 952.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 10:12:20,543 INFO L168 Benchmark]: Boogie Preprocessor took 16.64 ms. Allocated memory is still 1.0 GB. Free memory is still 952.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:12:20,543 INFO L168 Benchmark]: RCFGBuilder took 184.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -164.5 MB). Peak memory consumption was 25.3 MB. Max. memory is 11.5 GB. [2018-11-10 10:12:20,543 INFO L168 Benchmark]: TraceAbstraction took 4158.48 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 46.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.5 MB). Peak memory consumption was 296.6 MB. Max. memory is 11.5 GB. [2018-11-10 10:12:20,544 INFO L168 Benchmark]: Witness Printer took 52.22 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: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 11.5 GB. [2018-11-10 10:12:20,546 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 144.25 ms. Allocated memory is still 1.0 GB. Free memory was 963.0 MB in the beginning and 952.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.64 ms. Allocated memory is still 1.0 GB. Free memory is still 952.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 184.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -164.5 MB). Peak memory consumption was 25.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4158.48 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 46.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.5 MB). Peak memory consumption was 296.6 MB. Max. memory is 11.5 GB. * Witness Printer took 52.22 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: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: ((((((m <= 2147483647 && j <= 0) && ((((0 <= j && n <= 2147483647) && 0 <= i) && N <= 2147483647) && i <= 2147483646) && 0 <= N) && N <= k + 1) && N <= i) || (((((((0 <= j && n <= 2147483647) && 0 <= i) && N <= 2147483647) && 0 <= N) && m <= 2147483647) && j <= 0) && i <= 0)) || ((N <= k + 1 && ((((((0 <= j && n <= 2147483647) && 0 <= i) && 0 <= k) && i <= 2147483646) && 0 <= N) && k <= 2147483646) && m <= 2147483647) && N <= i + 1)) || ((m <= 0 && ((((0 <= j && n <= 2147483647) && 0 <= i) && N <= 2147483647) && i <= 2147483646) && 0 <= N) && j <= 0) - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: ((((((((0 <= j && n <= 2147483647) && 0 <= i) && 0 <= k) && N <= 2147483647) && 0 <= N) && k <= 2147483646) && m <= 2147483647) && i <= 0) || (((((((((0 <= j && n <= 2147483647) && 0 <= i) && 0 <= k) && N <= 2147483647) && 0 <= N) && k <= 2147483646) && m <= 2147483647) && N <= k + 1) && N <= i + 1) - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: ((((((n <= 2147483647 && 0 <= i) && N <= 2147483647) && 0 <= N) && m <= 2147483647) && i <= 0) || ((((((0 <= j && n <= 2147483647) && 0 <= i) && m <= j) && N <= 2147483647) && 0 <= N) && j <= 0)) || ((N <= k + 1 && ((((0 <= j && n <= 2147483647) && m <= j) && N <= 2147483647) && 0 <= N) && m <= 2147483647) && N <= i) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 34 locations, 8 error locations. SAFE Result, 4.1s OverallTime, 20 OverallIterations, 6 TraceHistogramMax, 1.4s AutomataDifference, 0.0s DeadEndRemovalTime, 1.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 475 SDtfs, 1227 SDslu, 899 SDs, 0 SdLazy, 673 SolverSat, 246 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 452 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 685 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 54 NumberOfFragments, 266 HoareAnnotationTreeSize, 7 FomulaSimplifications, 2973961 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 7 FomulaSimplificationsInter, 657913 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 790 NumberOfCodeBlocks, 760 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 761 ConstructedInterpolants, 0 QuantifiedInterpolants, 68037 SizeOfPredicates, 18 NumberOfNonLiveVariables, 670 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 29 InterpolantComputations, 11 PerfectInterpolantSequences, 161/545 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...