./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_7b1e5872-0e02-4e70-8486-10eca9103a05/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7b1e5872-0e02-4e70-8486-10eca9103a05/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7b1e5872-0e02-4e70-8486-10eca9103a05/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7b1e5872-0e02-4e70-8486-10eca9103a05/bin-2019/utaipan/config/TaipanReach.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_7b1e5872-0e02-4e70-8486-10eca9103a05/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7b1e5872-0e02-4e70-8486-10eca9103a05/bin-2019/utaipan --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 Taipan --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 08:59:54,442 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 08:59:54,443 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 08:59:54,450 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 08:59:54,450 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 08:59:54,451 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 08:59:54,452 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 08:59:54,453 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 08:59:54,454 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 08:59:54,454 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 08:59:54,455 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 08:59:54,455 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 08:59:54,456 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 08:59:54,456 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 08:59:54,457 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 08:59:54,457 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 08:59:54,458 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 08:59:54,459 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 08:59:54,460 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 08:59:54,461 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 08:59:54,462 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 08:59:54,462 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 08:59:54,464 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 08:59:54,464 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 08:59:54,464 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 08:59:54,465 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 08:59:54,465 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 08:59:54,466 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 08:59:54,466 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 08:59:54,467 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 08:59:54,467 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 08:59:54,468 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 08:59:54,468 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 08:59:54,468 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 08:59:54,469 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 08:59:54,469 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 08:59:54,469 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7b1e5872-0e02-4e70-8486-10eca9103a05/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf [2018-11-10 08:59:54,477 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 08:59:54,478 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 08:59:54,478 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 08:59:54,478 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 08:59:54,479 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 08:59:54,479 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 08:59:54,479 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 08:59:54,479 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 08:59:54,479 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 08:59:54,479 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 08:59:54,479 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 08:59:54,480 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 08:59:54,480 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 08:59:54,480 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 08:59:54,480 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 08:59:54,480 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 08:59:54,481 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 08:59:54,481 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 08:59:54,481 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-10 08:59:54,481 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 08:59:54,481 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 08:59:54,481 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 08:59:54,481 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 08:59:54,482 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 08:59:54,482 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 08:59:54,482 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 08:59:54,482 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 08:59:54,482 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 08:59:54,482 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 08:59:54,482 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 08:59:54,482 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 08:59:54,483 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 08:59:54,483 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 08:59:54,483 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_7b1e5872-0e02-4e70-8486-10eca9103a05/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ac99a20a7aff68d4303ed37ca9ad8305a1f8cf0d [2018-11-10 08:59:54,506 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 08:59:54,516 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 08:59:54,518 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 08:59:54,518 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 08:59:54,519 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 08:59:54,519 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7b1e5872-0e02-4e70-8486-10eca9103a05/bin-2019/utaipan/../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c [2018-11-10 08:59:54,560 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7b1e5872-0e02-4e70-8486-10eca9103a05/bin-2019/utaipan/data/188735340/a50165a423cc4d21804e5e84ce5b67a6/FLAG7ff3ba1fa [2018-11-10 08:59:54,953 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 08:59:54,954 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7b1e5872-0e02-4e70-8486-10eca9103a05/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c [2018-11-10 08:59:54,958 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7b1e5872-0e02-4e70-8486-10eca9103a05/bin-2019/utaipan/data/188735340/a50165a423cc4d21804e5e84ce5b67a6/FLAG7ff3ba1fa [2018-11-10 08:59:54,967 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7b1e5872-0e02-4e70-8486-10eca9103a05/bin-2019/utaipan/data/188735340/a50165a423cc4d21804e5e84ce5b67a6 [2018-11-10 08:59:54,969 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 08:59:54,970 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 08:59:54,971 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 08:59:54,971 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 08:59:54,974 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 08:59:54,975 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:59:54" (1/1) ... [2018-11-10 08:59:54,977 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dc2202b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:59:54, skipping insertion in model container [2018-11-10 08:59:54,977 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:59:54" (1/1) ... [2018-11-10 08:59:54,983 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 08:59:54,993 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 08:59:55,092 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 08:59:55,094 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 08:59:55,104 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 08:59:55,114 INFO L193 MainTranslator]: Completed translation [2018-11-10 08:59:55,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:59:55 WrapperNode [2018-11-10 08:59:55,114 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 08:59:55,115 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 08:59:55,115 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 08:59:55,115 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 08:59:55,119 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:59:55" (1/1) ... [2018-11-10 08:59:55,123 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:59:55" (1/1) ... [2018-11-10 08:59:55,126 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 08:59:55,127 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 08:59:55,127 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 08:59:55,127 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 08:59:55,132 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:59:55" (1/1) ... [2018-11-10 08:59:55,132 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:59:55" (1/1) ... [2018-11-10 08:59:55,133 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:59:55" (1/1) ... [2018-11-10 08:59:55,133 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:59:55" (1/1) ... [2018-11-10 08:59:55,135 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:59:55" (1/1) ... [2018-11-10 08:59:55,139 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:59:55" (1/1) ... [2018-11-10 08:59:55,140 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:59:55" (1/1) ... [2018-11-10 08:59:55,141 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 08:59:55,142 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 08:59:55,142 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 08:59:55,142 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 08:59:55,142 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:59:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b1e5872-0e02-4e70-8486-10eca9103a05/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 08:59:55,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 08:59:55,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 08:59:55,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 08:59:55,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 08:59:55,233 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 08:59:55,233 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 08:59:55,363 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 08:59:55,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 08:59:55 BoogieIcfgContainer [2018-11-10 08:59:55,364 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 08:59:55,365 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 08:59:55,365 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 08:59:55,367 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 08:59:55,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 08:59:54" (1/3) ... [2018-11-10 08:59:55,368 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40b114f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:59:55, skipping insertion in model container [2018-11-10 08:59:55,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:59:55" (2/3) ... [2018-11-10 08:59:55,369 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40b114f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:59:55, skipping insertion in model container [2018-11-10 08:59:55,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 08:59:55" (3/3) ... [2018-11-10 08:59:55,370 INFO L112 eAbstractionObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c [2018-11-10 08:59:55,379 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 08:59:55,386 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2018-11-10 08:59:55,400 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2018-11-10 08:59:55,427 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 08:59:55,427 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 08:59:55,427 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 08:59:55,427 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 08:59:55,427 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 08:59:55,427 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 08:59:55,428 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 08:59:55,428 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 08:59:55,443 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-11-10 08:59:55,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-10 08:59:55,448 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:59:55,449 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:59:55,451 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 08:59:55,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:59:55,458 INFO L82 PathProgramCache]: Analyzing trace with hash -2024263192, now seen corresponding path program 1 times [2018-11-10 08:59:55,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:59:55,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:59:55,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:59:55,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:59:55,506 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:59:55,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:59:55,556 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 08:59:55,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:59:55,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 08:59:55,558 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:59:55,561 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 08:59:55,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 08:59:55,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 08:59:55,570 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2018-11-10 08:59:55,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:59:55,582 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2018-11-10 08:59:55,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 08:59:55,583 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-10 08:59:55,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:59:55,591 INFO L225 Difference]: With dead ends: 62 [2018-11-10 08:59:55,591 INFO L226 Difference]: Without dead ends: 29 [2018-11-10 08:59:55,594 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 08:59:55,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-10 08:59:55,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-10 08:59:55,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-10 08:59:55,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-11-10 08:59:55,617 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 10 [2018-11-10 08:59:55,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:59:55,617 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-11-10 08:59:55,617 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 08:59:55,618 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-11-10 08:59:55,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-10 08:59:55,618 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:59:55,618 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:59:55,618 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 08:59:55,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:59:55,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1672316879, now seen corresponding path program 1 times [2018-11-10 08:59:55,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:59:55,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:59:55,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:59:55,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:59:55,620 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:59:55,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:59:55,648 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 08:59:55,648 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:59:55,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 08:59:55,649 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:59:55,650 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 08:59:55,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:59:55,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:59:55,650 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 3 states. [2018-11-10 08:59:55,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:59:55,689 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-11-10 08:59:55,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:59:55,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-10 08:59:55,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:59:55,691 INFO L225 Difference]: With dead ends: 51 [2018-11-10 08:59:55,691 INFO L226 Difference]: Without dead ends: 50 [2018-11-10 08:59:55,692 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 08:59:55,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-10 08:59:55,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 34. [2018-11-10 08:59:55,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-10 08:59:55,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-11-10 08:59:55,696 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 11 [2018-11-10 08:59:55,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:59:55,696 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2018-11-10 08:59:55,696 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 08:59:55,696 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-10 08:59:55,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-10 08:59:55,696 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:59:55,696 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:59:55,697 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 08:59:55,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:59:55,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1672316912, now seen corresponding path program 1 times [2018-11-10 08:59:55,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:59:55,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:59:55,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:59:55,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:59:55,698 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:59:55,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:59:55,723 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 08:59:55,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:59:55,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 08:59:55,724 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:59:55,724 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 08:59:55,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:59:55,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:59:55,724 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 3 states. [2018-11-10 08:59:55,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:59:55,756 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2018-11-10 08:59:55,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:59:55,757 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-10 08:59:55,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:59:55,758 INFO L225 Difference]: With dead ends: 45 [2018-11-10 08:59:55,758 INFO L226 Difference]: Without dead ends: 44 [2018-11-10 08:59:55,758 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 08:59:55,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-10 08:59:55,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2018-11-10 08:59:55,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-10 08:59:55,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-11-10 08:59:55,761 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 11 [2018-11-10 08:59:55,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:59:55,761 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-10 08:59:55,761 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 08:59:55,761 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-10 08:59:55,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-10 08:59:55,762 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:59:55,762 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:59:55,762 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 08:59:55,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:59:55,763 INFO L82 PathProgramCache]: Analyzing trace with hash 302215787, now seen corresponding path program 1 times [2018-11-10 08:59:55,763 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:59:55,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:59:55,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:59:55,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:59:55,764 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:59:55,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:59:55,786 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 08:59:55,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:59:55,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 08:59:55,786 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:59:55,786 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 08:59:55,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:59:55,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:59:55,787 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 3 states. [2018-11-10 08:59:55,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:59:55,804 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2018-11-10 08:59:55,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:59:55,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-11-10 08:59:55,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:59:55,805 INFO L225 Difference]: With dead ends: 58 [2018-11-10 08:59:55,805 INFO L226 Difference]: Without dead ends: 57 [2018-11-10 08:59:55,806 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 08:59:55,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-10 08:59:55,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 43. [2018-11-10 08:59:55,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-10 08:59:55,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2018-11-10 08:59:55,810 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 12 [2018-11-10 08:59:55,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:59:55,811 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2018-11-10 08:59:55,811 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 08:59:55,811 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2018-11-10 08:59:55,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-10 08:59:55,811 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:59:55,811 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:59:55,811 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 08:59:55,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:59:55,812 INFO L82 PathProgramCache]: Analyzing trace with hash 302216781, now seen corresponding path program 1 times [2018-11-10 08:59:55,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:59:55,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:59:55,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:59:55,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:59:55,813 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:59:55,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:59:55,845 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 08:59:55,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:59:55,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 08:59:55,846 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:59:55,846 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 08:59:55,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:59:55,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:59:55,847 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 3 states. [2018-11-10 08:59:55,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:59:55,861 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2018-11-10 08:59:55,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:59:55,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-11-10 08:59:55,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:59:55,862 INFO L225 Difference]: With dead ends: 43 [2018-11-10 08:59:55,862 INFO L226 Difference]: Without dead ends: 42 [2018-11-10 08:59:55,863 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 08:59:55,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-10 08:59:55,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-10 08:59:55,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-10 08:59:55,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2018-11-10 08:59:55,867 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 12 [2018-11-10 08:59:55,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:59:55,868 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2018-11-10 08:59:55,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 08:59:55,868 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-11-10 08:59:55,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-10 08:59:55,870 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:59:55,870 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:59:55,870 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 08:59:55,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:59:55,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1627447504, now seen corresponding path program 1 times [2018-11-10 08:59:55,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:59:55,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:59:55,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:59:55,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:59:55,872 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:59:55,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:59:55,897 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 08:59:55,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:59:55,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 08:59:55,898 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:59:55,898 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 08:59:55,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:59:55,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:59:55,898 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 3 states. [2018-11-10 08:59:55,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:59:55,912 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2018-11-10 08:59:55,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:59:55,913 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-10 08:59:55,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:59:55,913 INFO L225 Difference]: With dead ends: 42 [2018-11-10 08:59:55,913 INFO L226 Difference]: Without dead ends: 41 [2018-11-10 08:59:55,914 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 08:59:55,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-10 08:59:55,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-10 08:59:55,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-10 08:59:55,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2018-11-10 08:59:55,917 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 14 [2018-11-10 08:59:55,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:59:55,917 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-11-10 08:59:55,917 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 08:59:55,918 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2018-11-10 08:59:55,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-10 08:59:55,918 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:59:55,918 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:59:55,918 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 08:59:55,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:59:55,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1088734998, now seen corresponding path program 1 times [2018-11-10 08:59:55,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:59:55,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:59:55,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:59:55,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:59:55,920 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:59:55,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:59:55,938 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 08:59:55,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:59:55,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 08:59:55,938 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:59:55,939 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 08:59:55,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:59:55,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:59:55,939 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 3 states. [2018-11-10 08:59:55,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:59:55,961 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2018-11-10 08:59:55,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:59:55,961 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-10 08:59:55,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:59:55,962 INFO L225 Difference]: With dead ends: 41 [2018-11-10 08:59:55,962 INFO L226 Difference]: Without dead ends: 40 [2018-11-10 08:59:55,962 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 08:59:55,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-10 08:59:55,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-10 08:59:55,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-10 08:59:55,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2018-11-10 08:59:55,967 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 15 [2018-11-10 08:59:55,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:59:55,967 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2018-11-10 08:59:55,967 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 08:59:55,967 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2018-11-10 08:59:55,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-10 08:59:55,968 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:59:55,968 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:59:55,968 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 08:59:55,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:59:55,968 INFO L82 PathProgramCache]: Analyzing trace with hash -113098749, now seen corresponding path program 1 times [2018-11-10 08:59:55,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:59:55,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:59:55,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:59:55,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:59:55,970 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:59:55,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:59:56,005 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 08:59:56,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:59:56,006 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:59:56,006 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 18 with the following transitions: [2018-11-10 08:59:56,008 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [11], [17], [21], [25], [57], [58], [60], [69], [70], [71] [2018-11-10 08:59:56,043 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 08:59:56,044 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 08:59:56,233 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 08:59:56,234 INFO L272 AbstractInterpreter]: Visited 13 different actions 64 times. Merged at 6 different actions 44 times. Widened at 2 different actions 7 times. Found 1 fixpoints after 1 different actions. Largest state had 12 variables. [2018-11-10 08:59:56,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:59:56,241 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 08:59:56,303 INFO L227 lantSequenceWeakener]: Weakened 12 states. On average, predicates are now at 50% of their original sizes. [2018-11-10 08:59:56,304 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 08:59:56,392 INFO L415 sIntCurrentIteration]: We unified 16 AI predicates to 16 [2018-11-10 08:59:56,392 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 08:59:56,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 08:59:56,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [3] total 9 [2018-11-10 08:59:56,393 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:59:56,394 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 08:59:56,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 08:59:56,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-10 08:59:56,394 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 8 states. [2018-11-10 08:59:56,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:59:56,798 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2018-11-10 08:59:56,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 08:59:56,799 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-11-10 08:59:56,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:59:56,799 INFO L225 Difference]: With dead ends: 52 [2018-11-10 08:59:56,799 INFO L226 Difference]: Without dead ends: 51 [2018-11-10 08:59:56,800 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2018-11-10 08:59:56,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-10 08:59:56,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 35. [2018-11-10 08:59:56,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-10 08:59:56,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-11-10 08:59:56,806 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 17 [2018-11-10 08:59:56,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:59:56,806 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-11-10 08:59:56,806 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 08:59:56,807 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-10 08:59:56,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-10 08:59:56,807 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:59:56,807 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 08:59:56,807 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 08:59:56,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:59:56,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1697684744, now seen corresponding path program 1 times [2018-11-10 08:59:56,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:59:56,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:59:56,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:59:56,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:59:56,810 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:59:56,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:59:56,845 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 08:59:56,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:59:56,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:59:56,845 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:59:56,846 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 08:59:56,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 08:59:56,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 08:59:56,846 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 4 states. [2018-11-10 08:59:56,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:59:56,888 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-11-10 08:59:56,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 08:59:56,889 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-11-10 08:59:56,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:59:56,889 INFO L225 Difference]: With dead ends: 35 [2018-11-10 08:59:56,889 INFO L226 Difference]: Without dead ends: 34 [2018-11-10 08:59:56,890 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 08:59:56,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-10 08:59:56,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-10 08:59:56,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-10 08:59:56,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-11-10 08:59:56,896 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 17 [2018-11-10 08:59:56,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:59:56,896 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-11-10 08:59:56,896 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 08:59:56,896 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-10 08:59:56,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-10 08:59:56,897 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:59:56,897 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 08:59:56,897 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 08:59:56,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:59:56,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1088619433, now seen corresponding path program 1 times [2018-11-10 08:59:56,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:59:56,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:59:56,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:59:56,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:59:56,899 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:59:56,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:59:56,942 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 08:59:56,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:59:56,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:59:56,943 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:59:56,943 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 08:59:56,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 08:59:56,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 08:59:56,943 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 4 states. [2018-11-10 08:59:56,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:59:56,978 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2018-11-10 08:59:56,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 08:59:56,978 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-11-10 08:59:56,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:59:56,979 INFO L225 Difference]: With dead ends: 36 [2018-11-10 08:59:56,979 INFO L226 Difference]: Without dead ends: 34 [2018-11-10 08:59:56,979 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 08:59:56,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-10 08:59:56,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-11-10 08:59:56,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-10 08:59:56,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-11-10 08:59:56,988 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 18 [2018-11-10 08:59:56,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:59:56,988 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-11-10 08:59:56,988 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 08:59:56,988 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-10 08:59:56,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-10 08:59:56,989 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:59:56,989 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 08:59:56,990 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 08:59:56,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:59:56,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1807051700, now seen corresponding path program 1 times [2018-11-10 08:59:56,990 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:59:56,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:59:56,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:59:56,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:59:56,991 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:59:56,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:59:57,016 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 08:59:57,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:59:57,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:59:57,016 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:59:57,017 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 08:59:57,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 08:59:57,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 08:59:57,017 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 4 states. [2018-11-10 08:59:57,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:59:57,054 INFO L93 Difference]: Finished difference Result 71 states and 80 transitions. [2018-11-10 08:59:57,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 08:59:57,056 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-11-10 08:59:57,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:59:57,057 INFO L225 Difference]: With dead ends: 71 [2018-11-10 08:59:57,057 INFO L226 Difference]: Without dead ends: 70 [2018-11-10 08:59:57,057 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 08:59:57,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-10 08:59:57,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 47. [2018-11-10 08:59:57,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-10 08:59:57,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2018-11-10 08:59:57,064 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 20 [2018-11-10 08:59:57,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:59:57,064 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2018-11-10 08:59:57,064 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 08:59:57,064 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2018-11-10 08:59:57,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-10 08:59:57,065 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:59:57,065 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 08:59:57,065 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 08:59:57,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:59:57,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1807051733, now seen corresponding path program 1 times [2018-11-10 08:59:57,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:59:57,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:59:57,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:59:57,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:59:57,066 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:59:57,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:59:57,095 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 08:59:57,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:59:57,096 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:59:57,096 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-11-10 08:59:57,096 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [11], [17], [21], [27], [28], [29], [31], [35], [38], [40], [43], [53], [69], [70], [71] [2018-11-10 08:59:57,097 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 08:59:57,097 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 08:59:57,173 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 08:59:57,174 INFO L272 AbstractInterpreter]: Visited 18 different actions 87 times. Merged at 9 different actions 62 times. Widened at 2 different actions 6 times. Found 1 fixpoints after 1 different actions. Largest state had 12 variables. [2018-11-10 08:59:57,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:59:57,180 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 08:59:57,215 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 43.33% of their original sizes. [2018-11-10 08:59:57,216 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 08:59:57,311 INFO L415 sIntCurrentIteration]: We unified 19 AI predicates to 19 [2018-11-10 08:59:57,311 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 08:59:57,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 08:59:57,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [3] total 11 [2018-11-10 08:59:57,312 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:59:57,312 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 08:59:57,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 08:59:57,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-10 08:59:57,312 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand 10 states. [2018-11-10 08:59:57,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:59:57,887 INFO L93 Difference]: Finished difference Result 84 states and 95 transitions. [2018-11-10 08:59:57,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 08:59:57,887 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2018-11-10 08:59:57,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:59:57,887 INFO L225 Difference]: With dead ends: 84 [2018-11-10 08:59:57,888 INFO L226 Difference]: Without dead ends: 83 [2018-11-10 08:59:57,888 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2018-11-10 08:59:57,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-10 08:59:57,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 53. [2018-11-10 08:59:57,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-10 08:59:57,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2018-11-10 08:59:57,898 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 20 [2018-11-10 08:59:57,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:59:57,898 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2018-11-10 08:59:57,898 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 08:59:57,898 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2018-11-10 08:59:57,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 08:59:57,899 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:59:57,899 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 08:59:57,899 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 08:59:57,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:59:57,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1155182080, now seen corresponding path program 1 times [2018-11-10 08:59:57,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:59:57,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:59:57,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:59:57,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:59:57,904 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:59:57,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:59:57,922 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 08:59:57,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:59:57,923 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:59:57,923 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-11-10 08:59:57,923 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [11], [17], [21], [25], [27], [29], [31], [35], [38], [40], [43], [53], [57], [58], [60], [69], [70], [71] [2018-11-10 08:59:57,924 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 08:59:57,924 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 08:59:58,052 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 08:59:58,052 INFO L272 AbstractInterpreter]: Visited 21 different actions 217 times. Merged at 14 different actions 165 times. Widened at 4 different actions 23 times. Found 18 fixpoints after 6 different actions. Largest state had 12 variables. [2018-11-10 08:59:58,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:59:58,054 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 08:59:58,092 INFO L227 lantSequenceWeakener]: Weakened 21 states. On average, predicates are now at 37.3% of their original sizes. [2018-11-10 08:59:58,092 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 08:59:58,221 INFO L415 sIntCurrentIteration]: We unified 25 AI predicates to 25 [2018-11-10 08:59:58,221 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 08:59:58,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 08:59:58,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 15 [2018-11-10 08:59:58,222 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:59:58,222 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 08:59:58,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 08:59:58,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-11-10 08:59:58,222 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand 12 states. [2018-11-10 08:59:58,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:59:58,905 INFO L93 Difference]: Finished difference Result 111 states and 126 transitions. [2018-11-10 08:59:58,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 08:59:58,906 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2018-11-10 08:59:58,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:59:58,907 INFO L225 Difference]: With dead ends: 111 [2018-11-10 08:59:58,907 INFO L226 Difference]: Without dead ends: 109 [2018-11-10 08:59:58,908 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2018-11-10 08:59:58,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-10 08:59:58,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 62. [2018-11-10 08:59:58,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-10 08:59:58,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2018-11-10 08:59:58,921 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 26 [2018-11-10 08:59:58,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:59:58,922 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2018-11-10 08:59:58,922 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 08:59:58,922 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2018-11-10 08:59:58,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 08:59:58,922 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:59:58,922 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 08:59:58,922 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 08:59:58,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:59:58,922 INFO L82 PathProgramCache]: Analyzing trace with hash 411493416, now seen corresponding path program 2 times [2018-11-10 08:59:58,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:59:58,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:59:58,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:59:58,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:59:58,923 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:59:58,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:59:58,946 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:59:58,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:59:58,946 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:59:58,946 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:59:58,947 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:59:58,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:59:58,947 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b1e5872-0e02-4e70-8486-10eca9103a05/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:59:58,961 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 08:59:58,961 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 08:59:58,970 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-10 08:59:58,970 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:59:58,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:59:58,999 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 08:59:58,999 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:59:59,019 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 08:59:59,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:59:59,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 7 [2018-11-10 08:59:59,037 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:59:59,037 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 08:59:59,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 08:59:59,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-10 08:59:59,038 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand 7 states. [2018-11-10 08:59:59,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:59:59,131 INFO L93 Difference]: Finished difference Result 114 states and 132 transitions. [2018-11-10 08:59:59,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 08:59:59,131 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-11-10 08:59:59,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:59:59,132 INFO L225 Difference]: With dead ends: 114 [2018-11-10 08:59:59,132 INFO L226 Difference]: Without dead ends: 94 [2018-11-10 08:59:59,132 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-11-10 08:59:59,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-11-10 08:59:59,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 64. [2018-11-10 08:59:59,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-10 08:59:59,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 74 transitions. [2018-11-10 08:59:59,142 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 74 transitions. Word has length 26 [2018-11-10 08:59:59,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:59:59,143 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 74 transitions. [2018-11-10 08:59:59,143 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 08:59:59,143 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 74 transitions. [2018-11-10 08:59:59,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 08:59:59,143 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:59:59,143 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 08:59:59,144 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 08:59:59,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:59:59,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1936373826, now seen corresponding path program 1 times [2018-11-10 08:59:59,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:59:59,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:59:59,145 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:59:59,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:59:59,145 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:59:59,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:59:59,169 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 08:59:59,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:59:59,169 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:59:59,170 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-11-10 08:59:59,170 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [11], [17], [21], [25], [27], [29], [31], [35], [38], [40], [43], [45], [47], [49], [53], [57], [69], [70], [71] [2018-11-10 08:59:59,171 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 08:59:59,171 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 08:59:59,267 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 08:59:59,267 INFO L272 AbstractInterpreter]: Visited 22 different actions 268 times. Merged at 14 different actions 214 times. Widened at 3 different actions 25 times. Found 23 fixpoints after 3 different actions. Largest state had 12 variables. [2018-11-10 08:59:59,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:59:59,280 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 08:59:59,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:59:59,280 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b1e5872-0e02-4e70-8486-10eca9103a05/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:59:59,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:59:59,297 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 08:59:59,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:59:59,317 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:59:59,342 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 08:59:59,342 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:59:59,360 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 08:59:59,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:59:59,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2018-11-10 08:59:59,377 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:59:59,378 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 08:59:59,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 08:59:59,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-10 08:59:59,378 INFO L87 Difference]: Start difference. First operand 64 states and 74 transitions. Second operand 10 states. [2018-11-10 08:59:59,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:59:59,581 INFO L93 Difference]: Finished difference Result 203 states and 233 transitions. [2018-11-10 08:59:59,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-10 08:59:59,582 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2018-11-10 08:59:59,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:59:59,583 INFO L225 Difference]: With dead ends: 203 [2018-11-10 08:59:59,583 INFO L226 Difference]: Without dead ends: 202 [2018-11-10 08:59:59,583 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=236, Invalid=466, Unknown=0, NotChecked=0, Total=702 [2018-11-10 08:59:59,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-11-10 08:59:59,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 120. [2018-11-10 08:59:59,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-10 08:59:59,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 141 transitions. [2018-11-10 08:59:59,598 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 141 transitions. Word has length 26 [2018-11-10 08:59:59,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:59:59,598 INFO L481 AbstractCegarLoop]: Abstraction has 120 states and 141 transitions. [2018-11-10 08:59:59,598 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 08:59:59,598 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 141 transitions. [2018-11-10 08:59:59,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-10 08:59:59,599 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:59:59,599 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:59:59,599 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 08:59:59,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:59:59,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1167761707, now seen corresponding path program 1 times [2018-11-10 08:59:59,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:59:59,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:59:59,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:59:59,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:59:59,601 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:59:59,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:59:59,621 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 08:59:59,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:59:59,621 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:59:59,621 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2018-11-10 08:59:59,621 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [11], [17], [21], [25], [27], [28], [29], [31], [35], [38], [40], [43], [45], [47], [49], [53], [58], [60], [69], [70], [71] [2018-11-10 08:59:59,622 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 08:59:59,622 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 08:59:59,788 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 08:59:59,788 INFO L272 AbstractInterpreter]: Visited 24 different actions 359 times. Merged at 17 different actions 277 times. Widened at 5 different actions 39 times. Found 42 fixpoints after 6 different actions. Largest state had 12 variables. [2018-11-10 08:59:59,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:59:59,790 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 08:59:59,831 INFO L227 lantSequenceWeakener]: Weakened 27 states. On average, predicates are now at 37.65% of their original sizes. [2018-11-10 08:59:59,831 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 08:59:59,969 INFO L415 sIntCurrentIteration]: We unified 31 AI predicates to 31 [2018-11-10 08:59:59,969 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 08:59:59,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 08:59:59,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [3] total 15 [2018-11-10 08:59:59,969 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:59:59,970 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 08:59:59,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 08:59:59,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-11-10 08:59:59,970 INFO L87 Difference]: Start difference. First operand 120 states and 141 transitions. Second operand 14 states. [2018-11-10 09:00:00,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:00:00,509 INFO L93 Difference]: Finished difference Result 177 states and 206 transitions. [2018-11-10 09:00:00,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 09:00:00,509 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2018-11-10 09:00:00,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:00:00,510 INFO L225 Difference]: With dead ends: 177 [2018-11-10 09:00:00,510 INFO L226 Difference]: Without dead ends: 176 [2018-11-10 09:00:00,510 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 39 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=320, Unknown=0, NotChecked=0, Total=462 [2018-11-10 09:00:00,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-11-10 09:00:00,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 82. [2018-11-10 09:00:00,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-10 09:00:00,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 93 transitions. [2018-11-10 09:00:00,524 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 93 transitions. Word has length 32 [2018-11-10 09:00:00,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:00:00,525 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 93 transitions. [2018-11-10 09:00:00,525 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 09:00:00,525 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2018-11-10 09:00:00,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-10 09:00:00,526 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:00:00,526 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:00:00,526 INFO L424 AbstractCegarLoop]: === Iteration 17 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 09:00:00,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:00:00,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1102292195, now seen corresponding path program 3 times [2018-11-10 09:00:00,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:00:00,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:00:00,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:00:00,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:00:00,527 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:00:00,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:00:00,553 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 40 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-10 09:00:00,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:00:00,553 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 09:00:00,553 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 09:00:00,553 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 09:00:00,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:00:00,553 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b1e5872-0e02-4e70-8486-10eca9103a05/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:00:00,565 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 09:00:00,565 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 09:00:00,572 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 09:00:00,572 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:00:00,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:00:00,603 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 36 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 09:00:00,603 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 09:00:00,626 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 34 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 09:00:00,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 09:00:00,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2018-11-10 09:00:00,643 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 09:00:00,643 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 09:00:00,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 09:00:00,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 09:00:00,643 INFO L87 Difference]: Start difference. First operand 82 states and 93 transitions. Second operand 6 states. [2018-11-10 09:00:00,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:00:00,700 INFO L93 Difference]: Finished difference Result 133 states and 150 transitions. [2018-11-10 09:00:00,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 09:00:00,703 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-11-10 09:00:00,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:00:00,704 INFO L225 Difference]: With dead ends: 133 [2018-11-10 09:00:00,704 INFO L226 Difference]: Without dead ends: 78 [2018-11-10 09:00:00,704 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 92 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-10 09:00:00,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-10 09:00:00,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 70. [2018-11-10 09:00:00,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-10 09:00:00,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2018-11-10 09:00:00,720 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 47 [2018-11-10 09:00:00,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:00:00,720 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2018-11-10 09:00:00,720 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 09:00:00,721 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2018-11-10 09:00:00,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-10 09:00:00,721 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:00:00,721 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 09:00:00,722 INFO L424 AbstractCegarLoop]: === Iteration 18 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 09:00:00,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:00:00,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1525031015, now seen corresponding path program 1 times [2018-11-10 09:00:00,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:00:00,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:00:00,723 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:00:00,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:00:00,723 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:00:00,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:00:00,766 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 09:00:00,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:00:00,766 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 09:00:00,766 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 48 with the following transitions: [2018-11-10 09:00:00,767 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [11], [17], [21], [25], [27], [29], [31], [35], [38], [40], [43], [45], [47], [49], [53], [57], [58], [60], [69], [70], [71] [2018-11-10 09:00:00,768 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 09:00:00,768 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 09:00:00,929 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 09:00:00,929 INFO L272 AbstractInterpreter]: Visited 24 different actions 360 times. Merged at 18 different actions 280 times. Widened at 5 different actions 39 times. Found 45 fixpoints after 7 different actions. Largest state had 12 variables. [2018-11-10 09:00:00,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:00:00,953 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 09:00:00,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:00:00,953 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b1e5872-0e02-4e70-8486-10eca9103a05/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:00:00,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:00:00,966 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 09:00:00,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:00:00,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:00:00,992 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 09:00:00,992 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 09:00:01,071 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 09:00:01,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 09:00:01,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-11-10 09:00:01,097 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 09:00:01,098 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 09:00:01,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 09:00:01,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2018-11-10 09:00:01,098 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. Second operand 9 states. [2018-11-10 09:00:01,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:00:01,304 INFO L93 Difference]: Finished difference Result 186 states and 208 transitions. [2018-11-10 09:00:01,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-10 09:00:01,304 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 47 [2018-11-10 09:00:01,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:00:01,306 INFO L225 Difference]: With dead ends: 186 [2018-11-10 09:00:01,306 INFO L226 Difference]: Without dead ends: 185 [2018-11-10 09:00:01,307 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=263, Invalid=439, Unknown=0, NotChecked=0, Total=702 [2018-11-10 09:00:01,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-11-10 09:00:01,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 76. [2018-11-10 09:00:01,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-10 09:00:01,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2018-11-10 09:00:01,331 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 47 [2018-11-10 09:00:01,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:00:01,331 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2018-11-10 09:00:01,331 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 09:00:01,331 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2018-11-10 09:00:01,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-10 09:00:01,332 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:00:01,332 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 09:00:01,332 INFO L424 AbstractCegarLoop]: === Iteration 19 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 09:00:01,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:00:01,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1322840547, now seen corresponding path program 2 times [2018-11-10 09:00:01,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:00:01,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:00:01,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:00:01,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:00:01,333 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:00:01,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:00:01,412 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 09:00:01,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:00:01,412 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 09:00:01,412 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 09:00:01,413 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 09:00:01,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:00:01,413 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b1e5872-0e02-4e70-8486-10eca9103a05/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:00:01,426 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 09:00:01,427 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 09:00:01,437 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-10 09:00:01,437 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:00:01,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:00:01,468 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-10 09:00:01,468 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 09:00:01,497 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-10 09:00:01,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 09:00:01,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4, 4] total 12 [2018-11-10 09:00:01,516 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 09:00:01,517 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 09:00:01,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 09:00:01,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-11-10 09:00:01,517 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand 13 states. [2018-11-10 09:00:01,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:00:01,899 INFO L93 Difference]: Finished difference Result 247 states and 278 transitions. [2018-11-10 09:00:01,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-10 09:00:01,900 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2018-11-10 09:00:01,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:00:01,900 INFO L225 Difference]: With dead ends: 247 [2018-11-10 09:00:01,900 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 09:00:01,902 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 101 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=453, Invalid=879, Unknown=0, NotChecked=0, Total=1332 [2018-11-10 09:00:01,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 09:00:01,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 09:00:01,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 09:00:01,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 09:00:01,902 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 53 [2018-11-10 09:00:01,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:00:01,902 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 09:00:01,903 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 09:00:01,903 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 09:00:01,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 09:00:01,907 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 09:00:01,996 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:00:02,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:00:02,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:00:02,748 WARN L179 SmtUtils]: Spent 827.00 ms on a formula simplification. DAG size of input: 296 DAG size of output: 268 [2018-11-10 09:00:03,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:00:03,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:00:03,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:00:03,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:00:03,544 WARN L179 SmtUtils]: Spent 790.00 ms on a formula simplification. DAG size of input: 302 DAG size of output: 278 [2018-11-10 09:00:03,552 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:00:03,553 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:00:03,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:00:03,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:00:03,566 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:00:03,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:00:03,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:00:03,713 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 242 DAG size of output: 207 [2018-11-10 09:00:05,607 WARN L179 SmtUtils]: Spent 1.89 s on a formula simplification. DAG size of input: 264 DAG size of output: 57 [2018-11-10 09:00:07,296 WARN L179 SmtUtils]: Spent 1.68 s on a formula simplification. DAG size of input: 277 DAG size of output: 31 [2018-11-10 09:00:08,123 WARN L179 SmtUtils]: Spent 825.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 45 [2018-11-10 09:00:08,125 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-10 09:00:08,125 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 09:00:08,125 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 09:00:08,125 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 09:00:08,125 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 09:00:08,125 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 09:00:08,125 INFO L425 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2018-11-10 09:00:08,125 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 13 37) no Hoare annotation was computed. [2018-11-10 09:00:08,125 INFO L425 ceAbstractionStarter]: For program point L23-1(lines 23 34) no Hoare annotation was computed. [2018-11-10 09:00:08,125 INFO L421 ceAbstractionStarter]: At program point L23-3(lines 23 34) the Hoare annotation is: (let ((.cse6 (* 2 main_~m~0)) (.cse0 (* 2 main_~n~0))) (let ((.cse1 (<= .cse0 4294967294)) (.cse2 (<= main_~N~0 2147483647)) (.cse5 (<= main_~j~0 main_~m~0)) (.cse3 (<= .cse6 4294967294)) (.cse7 (<= 0 (* 2 main_~N~0)))) (or (let ((.cse4 (* 2 main_~i~0))) (and (<= 2 .cse0) (<= main_~m~0 main_~j~0) (and .cse1 (<= 0 main_~k~0) .cse2 .cse3) (<= 0 .cse4) .cse5 (<= (* 2 main_~k~0) 4294967294) (<= .cse4 4294967294) (<= 2 .cse6) .cse7)) (and (<= main_~m~0 0) (and (and (<= 0 main_~j~0) (<= 0 main_~i~0) .cse1) .cse2 (<= main_~i~0 main_~n~0)) .cse7 .cse5) (let ((.cse8 (+ main_~i~0 main_~n~0))) (and (<= 0 .cse6) (<= main_~N~0 (+ main_~i~0 2147483647)) (<= 0 .cse8) .cse3 (<= .cse8 2147483647) .cse7 (= main_~i~0 0)))))) [2018-11-10 09:00:08,126 INFO L425 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 33) no Hoare annotation was computed. [2018-11-10 09:00:08,126 INFO L425 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) no Hoare annotation was computed. [2018-11-10 09:00:08,126 INFO L425 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2018-11-10 09:00:08,126 INFO L425 ceAbstractionStarter]: For program point L28-1(lines 28 30) no Hoare annotation was computed. [2018-11-10 09:00:08,126 INFO L425 ceAbstractionStarter]: For program point L28-2(line 28) no Hoare annotation was computed. [2018-11-10 09:00:08,126 INFO L425 ceAbstractionStarter]: For program point L28-3(lines 28 30) no Hoare annotation was computed. [2018-11-10 09:00:08,126 INFO L421 ceAbstractionStarter]: At program point L28-5(lines 28 30) the Hoare annotation is: (let ((.cse0 (* 2 main_~n~0))) (and (<= 2 .cse0) (<= 0 main_~i~0) (<= 0 main_~k~0) (<= (* 2 main_~m~0) 4294967294) (<= main_~N~0 2147483647) (<= .cse0 4294967294) (<= 2 (* 2 main_~j~0)) (<= (* 2 main_~i~0) 4294967294) (<= 0 (* 2 main_~N~0)) (<= main_~k~0 2147483646) (<= main_~j~0 main_~m~0))) [2018-11-10 09:00:08,126 INFO L425 ceAbstractionStarter]: For program point L28-6(lines 28 30) no Hoare annotation was computed. [2018-11-10 09:00:08,126 INFO L425 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 33) no Hoare annotation was computed. [2018-11-10 09:00:08,126 INFO L425 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2018-11-10 09:00:08,126 INFO L425 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2018-11-10 09:00:08,126 INFO L425 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2018-11-10 09:00:08,127 INFO L425 ceAbstractionStarter]: For program point L29-1(line 29) no Hoare annotation was computed. [2018-11-10 09:00:08,127 INFO L425 ceAbstractionStarter]: For program point L25-1(lines 25 32) no Hoare annotation was computed. [2018-11-10 09:00:08,127 INFO L421 ceAbstractionStarter]: At program point L25-3(lines 25 32) the Hoare annotation is: (let ((.cse1 (* 2 main_~N~0)) (.cse0 (<= 0 main_~j~0)) (.cse2 (<= 0 main_~i~0)) (.cse8 (* 2 main_~n~0)) (.cse11 (* 2 main_~m~0))) (let ((.cse6 (+ main_~j~0 2147483647)) (.cse4 (<= 0 .cse11)) (.cse9 (and .cse0 .cse2 (<= .cse8 4294967294) (<= 0 main_~k~0) (<= main_~N~0 2147483647) (<= .cse11 4294967294) (<= main_~j~0 main_~m~0))) (.cse10 (<= main_~i~0 2147483646)) (.cse3 (<= main_~j~0 0)) (.cse7 (<= 0 .cse1)) (.cse5 (+ main_~j~0 1))) (or (and .cse0 (<= main_~n~0 2147483647) (<= .cse1 4294967294) .cse2 .cse3 .cse4 (<= .cse5 main_~n~0) (<= main_~m~0 .cse6) (<= main_~i~0 0) .cse7) (and (<= (+ main_~i~0 1) main_~n~0) (<= 0 (+ main_~i~0 main_~j~0)) (<= 0 (* 2 main_~j~0)) (<= main_~m~0 0) .cse3 (<= main_~N~0 .cse6) .cse4 (<= main_~n~0 (+ main_~m~0 2147483647)) .cse7) (and (<= 2 .cse8) (and .cse9 .cse10 (<= main_~k~0 2147483646)) (<= 2 .cse11) .cse7) (and (<= 1 (+ main_~j~0 main_~n~0)) (and .cse9 .cse10) .cse3 .cse7 (<= .cse5 main_~m~0))))) [2018-11-10 09:00:08,127 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 35) no Hoare annotation was computed. [2018-11-10 09:00:08,127 INFO L425 ceAbstractionStarter]: For program point L25-4(lines 25 32) no Hoare annotation was computed. [2018-11-10 09:00:08,127 INFO L425 ceAbstractionStarter]: For program point L21-1(lines 21 35) no Hoare annotation was computed. [2018-11-10 09:00:08,127 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 13 37) no Hoare annotation was computed. [2018-11-10 09:00:08,127 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 13 37) the Hoare annotation is: true [2018-11-10 09:00:08,127 INFO L425 ceAbstractionStarter]: For program point L26(line 26) no Hoare annotation was computed. [2018-11-10 09:00:08,127 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2018-11-10 09:00:08,127 INFO L425 ceAbstractionStarter]: For program point L26-1(line 26) no Hoare annotation was computed. [2018-11-10 09:00:08,127 INFO L425 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) no Hoare annotation was computed. [2018-11-10 09:00:08,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 09:00:08 BoogieIcfgContainer [2018-11-10 09:00:08,138 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 09:00:08,138 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 09:00:08,138 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 09:00:08,139 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 09:00:08,139 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 08:59:55" (3/4) ... [2018-11-10 09:00:08,141 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 09:00:08,147 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 09:00:08,147 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 09:00:08,151 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2018-11-10 09:00:08,151 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-11-10 09:00:08,152 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 09:00:08,152 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 09:00:08,183 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_7b1e5872-0e02-4e70-8486-10eca9103a05/bin-2019/utaipan/witness.graphml [2018-11-10 09:00:08,183 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 09:00:08,184 INFO L168 Benchmark]: Toolchain (without parser) took 13214.38 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 534.2 MB). Free memory was 960.3 MB in the beginning and 992.5 MB in the end (delta: -32.2 MB). Peak memory consumption was 502.1 MB. Max. memory is 11.5 GB. [2018-11-10 09:00:08,184 INFO L168 Benchmark]: CDTParser took 0.11 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 09:00:08,184 INFO L168 Benchmark]: CACSL2BoogieTranslator took 143.30 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 09:00:08,185 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.95 ms. Allocated memory is still 1.0 GB. Free memory is still 949.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 09:00:08,185 INFO L168 Benchmark]: Boogie Preprocessor took 14.74 ms. Allocated memory is still 1.0 GB. Free memory was 949.6 MB in the beginning and 946.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 09:00:08,185 INFO L168 Benchmark]: RCFGBuilder took 222.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.3 MB). Free memory was 946.9 MB in the beginning and 1.2 GB in the end (delta: -207.1 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. [2018-11-10 09:00:08,186 INFO L168 Benchmark]: TraceAbstraction took 12773.55 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 366.0 MB). Free memory was 1.2 GB in the beginning and 1.0 GB in the end (delta: 146.9 MB). Peak memory consumption was 630.1 MB. Max. memory is 11.5 GB. [2018-11-10 09:00:08,186 INFO L168 Benchmark]: Witness Printer took 44.96 ms. Allocated memory is still 1.6 GB. Free memory was 1.0 GB in the beginning and 992.5 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. [2018-11-10 09:00:08,188 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.11 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 143.30 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 11.95 ms. Allocated memory is still 1.0 GB. Free memory is still 949.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.74 ms. Allocated memory is still 1.0 GB. Free memory was 949.6 MB in the beginning and 946.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 222.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.3 MB). Free memory was 946.9 MB in the beginning and 1.2 GB in the end (delta: -207.1 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12773.55 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 366.0 MB). Free memory was 1.2 GB in the beginning and 1.0 GB in the end (delta: 146.9 MB). Peak memory consumption was 630.1 MB. Max. memory is 11.5 GB. * Witness Printer took 44.96 ms. Allocated memory is still 1.6 GB. Free memory was 1.0 GB in the beginning and 992.5 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 28]: 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: 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: 29]: 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 - PositiveResult [Line: 29]: 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: (((((((((((0 <= j && n <= 2147483647) && 2 * N <= 4294967294) && 0 <= i) && j <= 0) && 0 <= 2 * m) && j + 1 <= n) && m <= j + 2147483647) && i <= 0) && 0 <= 2 * N) || ((((((((i + 1 <= n && 0 <= i + j) && 0 <= 2 * j) && m <= 0) && j <= 0) && N <= j + 2147483647) && 0 <= 2 * m) && n <= m + 2147483647) && 0 <= 2 * N)) || (((2 <= 2 * n && (((((((0 <= j && 0 <= i) && 2 * n <= 4294967294) && 0 <= k) && N <= 2147483647) && 2 * m <= 4294967294) && j <= m) && i <= 2147483646) && k <= 2147483646) && 2 <= 2 * m) && 0 <= 2 * N)) || ((((1 <= j + n && ((((((0 <= j && 0 <= i) && 2 * n <= 4294967294) && 0 <= k) && N <= 2147483647) && 2 * m <= 4294967294) && j <= m) && i <= 2147483646) && j <= 0) && 0 <= 2 * N) && j + 1 <= m) - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: (((((((((2 <= 2 * n && 0 <= i) && 0 <= k) && 2 * m <= 4294967294) && N <= 2147483647) && 2 * n <= 4294967294) && 2 <= 2 * j) && 2 * i <= 4294967294) && 0 <= 2 * N) && k <= 2147483646) && j <= m - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: (((((((((2 <= 2 * n && m <= j) && ((2 * n <= 4294967294 && 0 <= k) && N <= 2147483647) && 2 * m <= 4294967294) && 0 <= 2 * i) && j <= m) && 2 * k <= 4294967294) && 2 * i <= 4294967294) && 2 <= 2 * m) && 0 <= 2 * N) || (((m <= 0 && (((0 <= j && 0 <= i) && 2 * n <= 4294967294) && N <= 2147483647) && i <= n) && 0 <= 2 * N) && j <= m)) || ((((((0 <= 2 * m && N <= i + 2147483647) && 0 <= i + n) && 2 * m <= 4294967294) && i + n <= 2147483647) && 0 <= 2 * N) && i == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 34 locations, 8 error locations. SAFE Result, 12.7s OverallTime, 19 OverallIterations, 6 TraceHistogramMax, 3.4s AutomataDifference, 0.0s DeadEndRemovalTime, 6.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 410 SDtfs, 1304 SDslu, 869 SDs, 0 SdLazy, 837 SolverSat, 298 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 8 DeclaredPredicates, 636 GetRequests, 444 SyntacticMatches, 9 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 857 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.9s AbstIntTime, 6 AbstIntIterations, 4 AbstIntStrong, 0.9844322344322345 AbsIntWeakeningRatio, 0.45054945054945056 AbsIntAvgWeakeningVarsNumRemoved, 37.417582417582416 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 478 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 59 NumberOfFragments, 355 HoareAnnotationTreeSize, 7 FomulaSimplifications, 4512157 FormulaSimplificationTreeSizeReduction, 1.8s HoareSimplificationTime, 7 FomulaSimplificationsInter, 3586898 FormulaSimplificationTreeSizeReductionInter, 4.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 633 NumberOfCodeBlocks, 575 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 803 ConstructedInterpolants, 0 QuantifiedInterpolants, 68749 SizeOfPredicates, 18 NumberOfNonLiveVariables, 335 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 29 InterpolantComputations, 10 PerfectInterpolantSequences, 272/575 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...