./Ultimate.py --spec ../../sv-benchmarks/c/NoOverflows.prp --file ../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-wise_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_2744d7c3-291f-4b9d-b7a2-e699ae57e00d/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2744d7c3-291f-4b9d-b7a2-e699ae57e00d/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2744d7c3-291f-4b9d-b7a2-e699ae57e00d/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2744d7c3-291f-4b9d-b7a2-e699ae57e00d/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-wise_true-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_2744d7c3-291f-4b9d-b7a2-e699ae57e00d/bin-2019/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2744d7c3-291f-4b9d-b7a2-e699ae57e00d/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 4c761fb15c9d367876fc9f1553874e9680fa1668 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 03:52:26,476 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 03:52:26,478 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 03:52:26,485 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 03:52:26,485 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 03:52:26,486 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 03:52:26,487 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 03:52:26,488 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 03:52:26,489 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 03:52:26,489 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 03:52:26,490 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 03:52:26,490 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 03:52:26,491 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 03:52:26,491 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 03:52:26,492 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 03:52:26,492 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 03:52:26,493 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 03:52:26,494 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 03:52:26,495 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 03:52:26,496 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 03:52:26,497 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 03:52:26,498 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 03:52:26,499 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 03:52:26,499 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 03:52:26,500 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 03:52:26,500 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 03:52:26,501 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 03:52:26,501 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 03:52:26,501 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 03:52:26,502 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 03:52:26,502 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 03:52:26,502 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 03:52:26,502 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 03:52:26,502 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 03:52:26,503 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 03:52:26,503 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 03:52:26,503 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2744d7c3-291f-4b9d-b7a2-e699ae57e00d/bin-2019/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf [2018-11-10 03:52:26,510 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 03:52:26,510 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 03:52:26,511 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 03:52:26,511 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 03:52:26,511 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 03:52:26,511 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 03:52:26,511 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 03:52:26,512 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 03:52:26,512 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 03:52:26,512 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 03:52:26,512 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 03:52:26,512 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 03:52:26,512 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 03:52:26,512 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 03:52:26,513 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-10 03:52:26,513 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 03:52:26,513 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 03:52:26,513 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 03:52:26,513 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 03:52:26,513 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 03:52:26,513 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 03:52:26,513 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 03:52:26,514 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 03:52:26,514 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 03:52:26,514 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 03:52:26,514 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 03:52:26,514 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 03:52:26,514 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 03:52:26,514 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_2744d7c3-291f-4b9d-b7a2-e699ae57e00d/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 -> 4c761fb15c9d367876fc9f1553874e9680fa1668 [2018-11-10 03:52:26,537 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 03:52:26,545 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 03:52:26,547 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 03:52:26,547 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 03:52:26,548 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 03:52:26,548 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2744d7c3-291f-4b9d-b7a2-e699ae57e00d/bin-2019/uautomizer/../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-wise_true-termination_true-no-overflow.c [2018-11-10 03:52:26,583 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2744d7c3-291f-4b9d-b7a2-e699ae57e00d/bin-2019/uautomizer/data/ef58b3ce5/e0215418805e49a7beac04c4b3fc276a/FLAG708abc84c [2018-11-10 03:52:26,973 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 03:52:26,974 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2744d7c3-291f-4b9d-b7a2-e699ae57e00d/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-wise_true-termination_true-no-overflow.c [2018-11-10 03:52:26,978 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2744d7c3-291f-4b9d-b7a2-e699ae57e00d/bin-2019/uautomizer/data/ef58b3ce5/e0215418805e49a7beac04c4b3fc276a/FLAG708abc84c [2018-11-10 03:52:26,988 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2744d7c3-291f-4b9d-b7a2-e699ae57e00d/bin-2019/uautomizer/data/ef58b3ce5/e0215418805e49a7beac04c4b3fc276a [2018-11-10 03:52:26,990 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 03:52:26,991 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 03:52:26,992 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 03:52:26,992 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 03:52:26,994 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 03:52:26,995 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:52:26" (1/1) ... [2018-11-10 03:52:26,996 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ac897aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:52:26, skipping insertion in model container [2018-11-10 03:52:26,997 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:52:26" (1/1) ... [2018-11-10 03:52:27,002 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 03:52:27,013 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 03:52:27,108 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:52:27,110 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 03:52:27,119 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:52:27,127 INFO L193 MainTranslator]: Completed translation [2018-11-10 03:52:27,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:52:27 WrapperNode [2018-11-10 03:52:27,128 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 03:52:27,128 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 03:52:27,128 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 03:52:27,128 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 03:52:27,135 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:52:27" (1/1) ... [2018-11-10 03:52:27,135 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:52:27" (1/1) ... [2018-11-10 03:52:27,138 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:52:27" (1/1) ... [2018-11-10 03:52:27,138 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:52:27" (1/1) ... [2018-11-10 03:52:27,140 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:52:27" (1/1) ... [2018-11-10 03:52:27,142 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:52:27" (1/1) ... [2018-11-10 03:52:27,143 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:52:27" (1/1) ... [2018-11-10 03:52:27,144 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 03:52:27,144 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 03:52:27,144 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 03:52:27,144 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 03:52:27,145 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:52:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2744d7c3-291f-4b9d-b7a2-e699ae57e00d/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 03:52:27,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 03:52:27,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 03:52:27,212 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 03:52:27,212 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-10 03:52:27,212 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 03:52:27,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 03:52:27,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 03:52:27,310 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 03:52:27,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:52:27 BoogieIcfgContainer [2018-11-10 03:52:27,310 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 03:52:27,311 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 03:52:27,311 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 03:52:27,312 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 03:52:27,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:52:26" (1/3) ... [2018-11-10 03:52:27,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@513bdcee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:52:27, skipping insertion in model container [2018-11-10 03:52:27,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:52:27" (2/3) ... [2018-11-10 03:52:27,314 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@513bdcee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:52:27, skipping insertion in model container [2018-11-10 03:52:27,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:52:27" (3/3) ... [2018-11-10 03:52:27,315 INFO L112 eAbstractionObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-wise_true-termination_true-no-overflow.c [2018-11-10 03:52:27,321 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 03:52:27,326 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2018-11-10 03:52:27,336 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2018-11-10 03:52:27,355 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 03:52:27,356 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 03:52:27,356 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 03:52:27,356 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 03:52:27,356 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 03:52:27,357 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 03:52:27,357 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 03:52:27,357 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 03:52:27,357 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 03:52:27,369 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-11-10 03:52:27,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-10 03:52:27,372 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:52:27,373 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:52:27,374 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 03:52:27,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:52:27,379 INFO L82 PathProgramCache]: Analyzing trace with hash -558530159, now seen corresponding path program 1 times [2018-11-10 03:52:27,380 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:52:27,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:52:27,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:52:27,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:52:27,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:52:27,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:52:27,483 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 03:52:27,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:52:27,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:52:27,487 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 03:52:27,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 03:52:27,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 03:52:27,496 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 4 states. [2018-11-10 03:52:27,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:52:27,594 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2018-11-10 03:52:27,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 03:52:27,595 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-11-10 03:52:27,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:52:27,601 INFO L225 Difference]: With dead ends: 60 [2018-11-10 03:52:27,601 INFO L226 Difference]: Without dead ends: 42 [2018-11-10 03:52:27,603 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 03:52:27,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-10 03:52:27,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 27. [2018-11-10 03:52:27,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-10 03:52:27,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-11-10 03:52:27,631 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 8 [2018-11-10 03:52:27,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:52:27,631 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-11-10 03:52:27,631 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 03:52:27,631 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-10 03:52:27,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-10 03:52:27,631 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:52:27,631 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:52:27,632 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 03:52:27,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:52:27,632 INFO L82 PathProgramCache]: Analyzing trace with hash -134565699, now seen corresponding path program 1 times [2018-11-10 03:52:27,632 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:52:27,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:52:27,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:52:27,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:52:27,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:52:27,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:52:27,666 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 03:52:27,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:52:27,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:52:27,668 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 03:52:27,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 03:52:27,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 03:52:27,669 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 4 states. [2018-11-10 03:52:27,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:52:27,763 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2018-11-10 03:52:27,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 03:52:27,763 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-11-10 03:52:27,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:52:27,764 INFO L225 Difference]: With dead ends: 56 [2018-11-10 03:52:27,764 INFO L226 Difference]: Without dead ends: 54 [2018-11-10 03:52:27,765 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 03:52:27,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-10 03:52:27,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 38. [2018-11-10 03:52:27,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-10 03:52:27,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2018-11-10 03:52:27,770 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 9 [2018-11-10 03:52:27,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:52:27,770 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2018-11-10 03:52:27,770 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 03:52:27,770 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2018-11-10 03:52:27,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-10 03:52:27,771 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:52:27,771 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:52:27,771 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 03:52:27,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:52:27,772 INFO L82 PathProgramCache]: Analyzing trace with hash 631324011, now seen corresponding path program 1 times [2018-11-10 03:52:27,772 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:52:27,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:52:27,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:52:27,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:52:27,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:52:27,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:52:27,802 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 03:52:27,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:52:27,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 03:52:27,803 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 03:52:27,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 03:52:27,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 03:52:27,803 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand 4 states. [2018-11-10 03:52:27,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:52:27,835 INFO L93 Difference]: Finished difference Result 70 states and 82 transitions. [2018-11-10 03:52:27,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 03:52:27,836 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-11-10 03:52:27,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:52:27,836 INFO L225 Difference]: With dead ends: 70 [2018-11-10 03:52:27,836 INFO L226 Difference]: Without dead ends: 40 [2018-11-10 03:52:27,837 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 03:52:27,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-10 03:52:27,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 34. [2018-11-10 03:52:27,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-10 03:52:27,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-11-10 03:52:27,841 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 13 [2018-11-10 03:52:27,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:52:27,842 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2018-11-10 03:52:27,842 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 03:52:27,842 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-10 03:52:27,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-10 03:52:27,842 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:52:27,842 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:52:27,843 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 03:52:27,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:52:27,843 INFO L82 PathProgramCache]: Analyzing trace with hash 631324203, now seen corresponding path program 1 times [2018-11-10 03:52:27,843 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:52:27,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:52:27,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:52:27,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:52:27,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:52:27,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:52:27,874 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 03:52:27,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:52:27,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 03:52:27,875 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 03:52:27,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 03:52:27,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-10 03:52:27,876 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 5 states. [2018-11-10 03:52:27,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:52:27,960 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2018-11-10 03:52:27,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 03:52:27,961 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-10 03:52:27,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:52:27,961 INFO L225 Difference]: With dead ends: 58 [2018-11-10 03:52:27,961 INFO L226 Difference]: Without dead ends: 57 [2018-11-10 03:52:27,962 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-10 03:52:27,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-10 03:52:27,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 50. [2018-11-10 03:52:27,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-10 03:52:27,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2018-11-10 03:52:27,967 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 13 [2018-11-10 03:52:27,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:52:27,967 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2018-11-10 03:52:27,967 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 03:52:27,967 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2018-11-10 03:52:27,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-10 03:52:27,968 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:52:27,968 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:52:27,968 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 03:52:27,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:52:27,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1903786113, now seen corresponding path program 1 times [2018-11-10 03:52:27,969 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:52:27,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:52:27,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:52:27,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:52:27,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:52:27,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:52:27,985 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 03:52:27,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:52:27,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 03:52:27,985 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 03:52:27,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:52:27,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:52:27,986 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. Second operand 3 states. [2018-11-10 03:52:28,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:52:28,001 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2018-11-10 03:52:28,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:52:28,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-10 03:52:28,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:52:28,002 INFO L225 Difference]: With dead ends: 50 [2018-11-10 03:52:28,002 INFO L226 Difference]: Without dead ends: 49 [2018-11-10 03:52:28,002 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 03:52:28,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-10 03:52:28,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-11-10 03:52:28,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-10 03:52:28,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2018-11-10 03:52:28,006 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 14 [2018-11-10 03:52:28,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:52:28,007 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2018-11-10 03:52:28,007 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 03:52:28,007 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2018-11-10 03:52:28,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-10 03:52:28,007 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:52:28,007 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:52:28,008 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 03:52:28,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:52:28,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1161585095, now seen corresponding path program 1 times [2018-11-10 03:52:28,008 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:52:28,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:52:28,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:52:28,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:52:28,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:52:28,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:52:28,036 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 03:52:28,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:52:28,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 03:52:28,036 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 03:52:28,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 03:52:28,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-10 03:52:28,037 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand 5 states. [2018-11-10 03:52:28,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:52:28,154 INFO L93 Difference]: Finished difference Result 102 states and 123 transitions. [2018-11-10 03:52:28,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 03:52:28,155 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-10 03:52:28,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:52:28,156 INFO L225 Difference]: With dead ends: 102 [2018-11-10 03:52:28,156 INFO L226 Difference]: Without dead ends: 101 [2018-11-10 03:52:28,156 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-10 03:52:28,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-10 03:52:28,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 88. [2018-11-10 03:52:28,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-10 03:52:28,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 112 transitions. [2018-11-10 03:52:28,164 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 112 transitions. Word has length 15 [2018-11-10 03:52:28,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:52:28,164 INFO L481 AbstractCegarLoop]: Abstraction has 88 states and 112 transitions. [2018-11-10 03:52:28,164 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 03:52:28,164 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 112 transitions. [2018-11-10 03:52:28,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-10 03:52:28,165 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:52:28,165 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:52:28,165 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 03:52:28,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:52:28,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1161585287, now seen corresponding path program 1 times [2018-11-10 03:52:28,165 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:52:28,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:52:28,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:52:28,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:52:28,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:52:28,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:52:28,184 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 03:52:28,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:52:28,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 03:52:28,184 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 03:52:28,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 03:52:28,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 03:52:28,185 INFO L87 Difference]: Start difference. First operand 88 states and 112 transitions. Second operand 4 states. [2018-11-10 03:52:28,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:52:28,206 INFO L93 Difference]: Finished difference Result 125 states and 156 transitions. [2018-11-10 03:52:28,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 03:52:28,206 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-10 03:52:28,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:52:28,207 INFO L225 Difference]: With dead ends: 125 [2018-11-10 03:52:28,207 INFO L226 Difference]: Without dead ends: 61 [2018-11-10 03:52:28,207 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 03:52:28,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-10 03:52:28,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 53. [2018-11-10 03:52:28,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-10 03:52:28,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2018-11-10 03:52:28,211 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 15 [2018-11-10 03:52:28,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:52:28,212 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2018-11-10 03:52:28,212 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 03:52:28,212 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2018-11-10 03:52:28,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-10 03:52:28,212 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:52:28,212 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:52:28,213 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 03:52:28,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:52:28,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1649399645, now seen corresponding path program 1 times [2018-11-10 03:52:28,213 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:52:28,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:52:28,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:52:28,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:52:28,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:52:28,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:52:28,230 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 03:52:28,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:52:28,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 03:52:28,230 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 03:52:28,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:52:28,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:52:28,231 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand 3 states. [2018-11-10 03:52:28,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:52:28,243 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2018-11-10 03:52:28,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:52:28,243 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-10 03:52:28,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:52:28,244 INFO L225 Difference]: With dead ends: 53 [2018-11-10 03:52:28,244 INFO L226 Difference]: Without dead ends: 52 [2018-11-10 03:52:28,244 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 03:52:28,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-10 03:52:28,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-11-10 03:52:28,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-10 03:52:28,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2018-11-10 03:52:28,249 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 16 [2018-11-10 03:52:28,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:52:28,249 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2018-11-10 03:52:28,249 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 03:52:28,249 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2018-11-10 03:52:28,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-10 03:52:28,249 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:52:28,250 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:52:28,250 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 03:52:28,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:52:28,250 INFO L82 PathProgramCache]: Analyzing trace with hash -648907892, now seen corresponding path program 1 times [2018-11-10 03:52:28,250 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:52:28,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:52:28,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:52:28,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:52:28,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:52:28,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:52:28,298 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:52:28,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:52:28,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 03:52:28,299 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 03:52:28,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 03:52:28,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 03:52:28,299 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 5 states. [2018-11-10 03:52:28,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:52:28,338 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2018-11-10 03:52:28,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 03:52:28,338 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-10 03:52:28,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:52:28,339 INFO L225 Difference]: With dead ends: 66 [2018-11-10 03:52:28,339 INFO L226 Difference]: Without dead ends: 30 [2018-11-10 03:52:28,339 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-10 03:52:28,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-10 03:52:28,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-10 03:52:28,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-10 03:52:28,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-11-10 03:52:28,342 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 17 [2018-11-10 03:52:28,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:52:28,342 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-11-10 03:52:28,343 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 03:52:28,343 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-11-10 03:52:28,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-10 03:52:28,343 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:52:28,343 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:52:28,344 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 03:52:28,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:52:28,344 INFO L82 PathProgramCache]: Analyzing trace with hash 230127936, now seen corresponding path program 1 times [2018-11-10 03:52:28,344 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:52:28,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:52:28,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:52:28,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:52:28,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:52:28,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:52:28,370 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:52:28,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:52:28,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 03:52:28,370 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 03:52:28,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 03:52:28,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 03:52:28,371 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 5 states. [2018-11-10 03:52:28,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:52:28,406 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2018-11-10 03:52:28,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 03:52:28,407 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-11-10 03:52:28,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:52:28,407 INFO L225 Difference]: With dead ends: 35 [2018-11-10 03:52:28,407 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 03:52:28,408 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-10 03:52:28,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 03:52:28,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 03:52:28,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 03:52:28,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 03:52:28,409 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2018-11-10 03:52:28,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:52:28,409 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 03:52:28,409 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 03:52:28,410 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 03:52:28,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 03:52:28,413 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 03:52:28,453 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-10 03:52:28,454 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 03:52:28,454 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 03:52:28,454 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 03:52:28,454 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 03:52:28,454 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 03:52:28,454 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 18) no Hoare annotation was computed. [2018-11-10 03:52:28,454 INFO L425 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 18) no Hoare annotation was computed. [2018-11-10 03:52:28,454 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 13 27) no Hoare annotation was computed. [2018-11-10 03:52:28,455 INFO L425 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-10 03:52:28,455 INFO L425 ceAbstractionStarter]: For program point L19(lines 19 23) no Hoare annotation was computed. [2018-11-10 03:52:28,455 INFO L425 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2018-11-10 03:52:28,455 INFO L425 ceAbstractionStarter]: For program point L17(lines 17 25) no Hoare annotation was computed. [2018-11-10 03:52:28,455 INFO L421 ceAbstractionStarter]: At program point L19-2(lines 18 24) the Hoare annotation is: (and (<= main_~x~0 2147483647) (<= main_~y~0 2147483647) (<= 0 main_~y~0) (<= 0 main_~x~0)) [2018-11-10 03:52:28,455 INFO L425 ceAbstractionStarter]: For program point L17-1(lines 17 25) no Hoare annotation was computed. [2018-11-10 03:52:28,455 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 13 27) no Hoare annotation was computed. [2018-11-10 03:52:28,455 INFO L425 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 18) no Hoare annotation was computed. [2018-11-10 03:52:28,456 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 13 27) the Hoare annotation is: true [2018-11-10 03:52:28,456 INFO L425 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 18) no Hoare annotation was computed. [2018-11-10 03:52:28,456 INFO L425 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-11-10 03:52:28,456 INFO L425 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2018-11-10 03:52:28,456 INFO L425 ceAbstractionStarter]: For program point L22-1(line 22) no Hoare annotation was computed. [2018-11-10 03:52:28,456 INFO L425 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2018-11-10 03:52:28,456 INFO L425 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2018-11-10 03:52:28,456 INFO L425 ceAbstractionStarter]: For program point L18-1(lines 18 24) no Hoare annotation was computed. [2018-11-10 03:52:28,456 INFO L425 ceAbstractionStarter]: For program point L18-2(line 18) no Hoare annotation was computed. [2018-11-10 03:52:28,456 INFO L425 ceAbstractionStarter]: For program point L18-3(line 18) no Hoare annotation was computed. [2018-11-10 03:52:28,457 INFO L425 ceAbstractionStarter]: For program point L18-5(line 18) no Hoare annotation was computed. [2018-11-10 03:52:28,457 INFO L425 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-10 03:52:28,457 INFO L425 ceAbstractionStarter]: For program point L18-6(line 18) no Hoare annotation was computed. [2018-11-10 03:52:28,457 INFO L425 ceAbstractionStarter]: For program point L18-7(lines 18 24) no Hoare annotation was computed. [2018-11-10 03:52:28,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 03:52:28 BoogieIcfgContainer [2018-11-10 03:52:28,465 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 03:52:28,465 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 03:52:28,465 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 03:52:28,466 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 03:52:28,466 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:52:27" (3/4) ... [2018-11-10 03:52:28,468 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 03:52:28,472 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 03:52:28,473 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 03:52:28,475 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-10 03:52:28,476 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-10 03:52:28,476 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 03:52:28,502 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_2744d7c3-291f-4b9d-b7a2-e699ae57e00d/bin-2019/uautomizer/witness.graphml [2018-11-10 03:52:28,502 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 03:52:28,503 INFO L168 Benchmark]: Toolchain (without parser) took 1512.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 958.2 MB in the beginning and 966.0 MB in the end (delta: -7.8 MB). Peak memory consumption was 129.6 MB. Max. memory is 11.5 GB. [2018-11-10 03:52:28,504 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 03:52:28,504 INFO L168 Benchmark]: CACSL2BoogieTranslator took 136.12 ms. Allocated memory is still 1.0 GB. Free memory was 958.2 MB in the beginning and 947.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 03:52:28,504 INFO L168 Benchmark]: Boogie Preprocessor took 15.76 ms. Allocated memory is still 1.0 GB. Free memory is still 947.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 03:52:28,504 INFO L168 Benchmark]: RCFGBuilder took 166.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 947.4 MB in the beginning and 1.1 GB in the end (delta: -177.7 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. [2018-11-10 03:52:28,505 INFO L168 Benchmark]: TraceAbstraction took 1154.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 968.6 MB in the end (delta: 156.5 MB). Peak memory consumption was 156.5 MB. Max. memory is 11.5 GB. [2018-11-10 03:52:28,505 INFO L168 Benchmark]: Witness Printer took 37.04 ms. Allocated memory is still 1.2 GB. Free memory was 968.6 MB in the beginning and 966.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 03:52:28,506 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 136.12 ms. Allocated memory is still 1.0 GB. Free memory was 958.2 MB in the beginning and 947.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.76 ms. Allocated memory is still 1.0 GB. Free memory is still 947.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 166.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 947.4 MB in the beginning and 1.1 GB in the end (delta: -177.7 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1154.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 968.6 MB in the end (delta: 156.5 MB). Peak memory consumption was 156.5 MB. Max. memory is 11.5 GB. * Witness Printer took 37.04 ms. Allocated memory is still 1.2 GB. Free memory was 968.6 MB in the beginning and 966.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 18]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 18]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 18]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 18]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: 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: 18]: Loop Invariant Derived loop invariant: ((x <= 2147483647 && y <= 2147483647) && 0 <= y) && 0 <= x - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 31 locations, 8 error locations. SAFE Result, 1.1s OverallTime, 10 OverallIterations, 2 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 142 SDtfs, 250 SDslu, 133 SDs, 0 SdLazy, 352 SolverSat, 62 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 65 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 8 NumberOfFragments, 17 HoareAnnotationTreeSize, 5 FomulaSimplifications, 30 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 51 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 138 NumberOfCodeBlocks, 138 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 128 ConstructedInterpolants, 0 QuantifiedInterpolants, 4325 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 5/5 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...