./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/byte_add_1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/byte_add_1-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c172e82b435756efbbcf3396e72051c66081518f ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Overflow*32bit*_Bitvector*.epf No suitable settings file found using Overflow*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 20:26:44,450 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:26:44,452 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:26:44,470 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:26:44,471 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:26:44,473 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:26:44,475 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:26:44,485 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:26:44,487 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:26:44,488 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:26:44,489 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:26:44,490 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:26:44,491 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:26:44,492 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:26:44,493 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:26:44,494 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:26:44,495 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:26:44,496 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:26:44,498 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:26:44,500 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:26:44,501 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:26:44,502 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:26:44,503 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:26:44,504 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:26:44,507 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:26:44,507 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:26:44,508 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:26:44,509 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:26:44,509 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:26:44,510 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:26:44,511 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:26:44,511 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:26:44,512 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:26:44,513 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:26:44,514 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:26:44,515 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:26:44,515 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:26:44,516 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:26:44,516 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:26:44,517 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:26:44,518 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:26:44,519 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2019-11-28 20:26:44,534 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:26:44,534 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:26:44,536 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:26:44,536 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:26:44,536 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:26:44,536 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:26:44,537 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 20:26:44,537 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:26:44,537 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:26:44,537 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 20:26:44,537 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:26:44,538 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 20:26:44,538 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 20:26:44,538 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 20:26:44,538 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-11-28 20:26:44,538 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 20:26:44,539 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 20:26:44,539 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:26:44,539 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 20:26:44,539 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:26:44,540 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:26:44,540 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 20:26:44,540 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 20:26:44,540 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 20:26:44,540 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:26:44,541 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 20:26:44,541 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 20:26:44,541 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:26:44,541 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 20:26:44,542 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 20:26:44,542 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:26:44,542 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c172e82b435756efbbcf3396e72051c66081518f [2019-11-28 20:26:44,849 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:26:44,870 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:26:44,877 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:26:44,879 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:26:44,880 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:26:44,881 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add_1-2.i [2019-11-28 20:26:44,960 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dffe1f225/1513e089842e4929b9f267c49f45c3f8/FLAGd85c1dd84 [2019-11-28 20:26:45,367 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:26:45,368 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-2.i [2019-11-28 20:26:45,375 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dffe1f225/1513e089842e4929b9f267c49f45c3f8/FLAGd85c1dd84 [2019-11-28 20:26:45,792 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dffe1f225/1513e089842e4929b9f267c49f45c3f8 [2019-11-28 20:26:45,796 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:26:45,798 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 20:26:45,799 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:26:45,799 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:26:45,805 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:26:45,806 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:26:45" (1/1) ... [2019-11-28 20:26:45,810 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f74f45b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:26:45, skipping insertion in model container [2019-11-28 20:26:45,810 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:26:45" (1/1) ... [2019-11-28 20:26:45,818 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:26:45,845 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:26:46,052 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:26:46,057 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:26:46,152 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:26:46,168 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:26:46,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:26:46 WrapperNode [2019-11-28 20:26:46,169 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:26:46,169 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 20:26:46,169 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 20:26:46,170 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 20:26:46,178 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:26:46" (1/1) ... [2019-11-28 20:26:46,192 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:26:46" (1/1) ... [2019-11-28 20:26:46,254 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 20:26:46,255 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:26:46,255 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:26:46,255 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:26:46,271 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:26:46" (1/1) ... [2019-11-28 20:26:46,271 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:26:46" (1/1) ... [2019-11-28 20:26:46,283 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:26:46" (1/1) ... [2019-11-28 20:26:46,284 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:26:46" (1/1) ... [2019-11-28 20:26:46,299 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:26:46" (1/1) ... [2019-11-28 20:26:46,312 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:26:46" (1/1) ... [2019-11-28 20:26:46,314 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:26:46" (1/1) ... [2019-11-28 20:26:46,326 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:26:46,327 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:26:46,327 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:26:46,327 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:26:46,328 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:26:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 20:26:46,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:26:46,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:26:47,171 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:26:47,171 INFO L287 CfgBuilder]: Removed 10 assume(true) statements. [2019-11-28 20:26:47,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:26:47 BoogieIcfgContainer [2019-11-28 20:26:47,173 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:26:47,174 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 20:26:47,174 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 20:26:47,177 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 20:26:47,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:26:45" (1/3) ... [2019-11-28 20:26:47,179 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b064d7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:26:47, skipping insertion in model container [2019-11-28 20:26:47,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:26:46" (2/3) ... [2019-11-28 20:26:47,179 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b064d7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:26:47, skipping insertion in model container [2019-11-28 20:26:47,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:26:47" (3/3) ... [2019-11-28 20:26:47,181 INFO L109 eAbstractionObserver]: Analyzing ICFG byte_add_1-2.i [2019-11-28 20:26:47,192 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 20:26:47,201 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 38 error locations. [2019-11-28 20:26:47,214 INFO L249 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2019-11-28 20:26:47,240 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 20:26:47,240 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 20:26:47,240 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 20:26:47,240 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:26:47,241 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:26:47,241 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 20:26:47,241 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:26:47,241 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 20:26:47,269 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states. [2019-11-28 20:26:47,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-11-28 20:26:47,275 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:26:47,276 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-11-28 20:26:47,277 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:26:47,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:26:47,284 INFO L82 PathProgramCache]: Analyzing trace with hash 30881, now seen corresponding path program 1 times [2019-11-28 20:26:47,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:26:47,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305660917] [2019-11-28 20:26:47,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:26:47,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:47,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:26:47,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305660917] [2019-11-28 20:26:47,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:26:47,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 20:26:47,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829727678] [2019-11-28 20:26:47,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 20:26:47,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:26:47,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 20:26:47,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 20:26:47,452 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 2 states. [2019-11-28 20:26:47,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:26:47,473 INFO L93 Difference]: Finished difference Result 134 states and 176 transitions. [2019-11-28 20:26:47,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 20:26:47,475 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 3 [2019-11-28 20:26:47,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:26:47,487 INFO L225 Difference]: With dead ends: 134 [2019-11-28 20:26:47,487 INFO L226 Difference]: Without dead ends: 68 [2019-11-28 20:26:47,491 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 20:26:47,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-28 20:26:47,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-11-28 20:26:47,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-28 20:26:47,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 94 transitions. [2019-11-28 20:26:47,550 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 94 transitions. Word has length 3 [2019-11-28 20:26:47,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:26:47,551 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 94 transitions. [2019-11-28 20:26:47,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 20:26:47,552 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 94 transitions. [2019-11-28 20:26:47,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 20:26:47,554 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:26:47,554 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:26:47,558 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:26:47,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:26:47,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1126401592, now seen corresponding path program 1 times [2019-11-28 20:26:47,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:26:47,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409736913] [2019-11-28 20:26:47,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:26:47,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:47,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:26:47,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409736913] [2019-11-28 20:26:47,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:26:47,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:26:47,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37090433] [2019-11-28 20:26:47,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:26:47,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:26:47,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:26:47,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:26:47,711 INFO L87 Difference]: Start difference. First operand 68 states and 94 transitions. Second operand 3 states. [2019-11-28 20:26:48,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:26:48,008 INFO L93 Difference]: Finished difference Result 144 states and 211 transitions. [2019-11-28 20:26:48,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:26:48,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-11-28 20:26:48,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:26:48,012 INFO L225 Difference]: With dead ends: 144 [2019-11-28 20:26:48,014 INFO L226 Difference]: Without dead ends: 97 [2019-11-28 20:26:48,015 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:26:48,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-11-28 20:26:48,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2019-11-28 20:26:48,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-28 20:26:48,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 123 transitions. [2019-11-28 20:26:48,033 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 123 transitions. Word has length 12 [2019-11-28 20:26:48,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:26:48,035 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 123 transitions. [2019-11-28 20:26:48,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:26:48,035 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 123 transitions. [2019-11-28 20:26:48,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 20:26:48,037 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:26:48,037 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:26:48,038 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:26:48,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:26:48,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1247347973, now seen corresponding path program 1 times [2019-11-28 20:26:48,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:26:48,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733871464] [2019-11-28 20:26:48,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:26:48,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:48,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:26:48,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733871464] [2019-11-28 20:26:48,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:26:48,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 20:26:48,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941776435] [2019-11-28 20:26:48,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 20:26:48,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:26:48,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:26:48,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:26:48,226 INFO L87 Difference]: Start difference. First operand 93 states and 123 transitions. Second operand 5 states. [2019-11-28 20:26:48,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:26:48,610 INFO L93 Difference]: Finished difference Result 237 states and 316 transitions. [2019-11-28 20:26:48,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:26:48,610 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-28 20:26:48,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:26:48,613 INFO L225 Difference]: With dead ends: 237 [2019-11-28 20:26:48,613 INFO L226 Difference]: Without dead ends: 173 [2019-11-28 20:26:48,614 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:26:48,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-11-28 20:26:48,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 106. [2019-11-28 20:26:48,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-28 20:26:48,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 139 transitions. [2019-11-28 20:26:48,626 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 139 transitions. Word has length 19 [2019-11-28 20:26:48,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:26:48,626 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 139 transitions. [2019-11-28 20:26:48,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 20:26:48,627 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 139 transitions. [2019-11-28 20:26:48,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 20:26:48,628 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:26:48,628 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:26:48,629 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:26:48,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:26:48,629 INFO L82 PathProgramCache]: Analyzing trace with hash 630219950, now seen corresponding path program 1 times [2019-11-28 20:26:48,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:26:48,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189076763] [2019-11-28 20:26:48,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:26:48,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:48,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 20:26:48,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189076763] [2019-11-28 20:26:48,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:26:48,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:26:48,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582854440] [2019-11-28 20:26:48,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:26:48,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:26:48,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:26:48,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:26:48,738 INFO L87 Difference]: Start difference. First operand 106 states and 139 transitions. Second operand 3 states. [2019-11-28 20:26:48,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:26:48,747 INFO L93 Difference]: Finished difference Result 171 states and 226 transitions. [2019-11-28 20:26:48,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:26:48,748 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-28 20:26:48,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:26:48,749 INFO L225 Difference]: With dead ends: 171 [2019-11-28 20:26:48,750 INFO L226 Difference]: Without dead ends: 80 [2019-11-28 20:26:48,751 INFO L630 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 [2019-11-28 20:26:48,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-28 20:26:48,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-11-28 20:26:48,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-28 20:26:48,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 105 transitions. [2019-11-28 20:26:48,759 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 105 transitions. Word has length 22 [2019-11-28 20:26:48,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:26:48,760 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 105 transitions. [2019-11-28 20:26:48,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:26:48,760 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 105 transitions. [2019-11-28 20:26:48,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 20:26:48,762 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:26:48,762 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:26:48,763 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:26:48,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:26:48,764 INFO L82 PathProgramCache]: Analyzing trace with hash 898692249, now seen corresponding path program 1 times [2019-11-28 20:26:48,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:26:48,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957048557] [2019-11-28 20:26:48,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:26:48,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:48,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:26:48,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957048557] [2019-11-28 20:26:48,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:26:48,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:26:48,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415791029] [2019-11-28 20:26:48,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:26:48,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:26:48,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:26:48,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:26:48,872 INFO L87 Difference]: Start difference. First operand 80 states and 105 transitions. Second operand 3 states. [2019-11-28 20:26:48,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:26:48,888 INFO L93 Difference]: Finished difference Result 104 states and 138 transitions. [2019-11-28 20:26:48,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:26:48,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-28 20:26:48,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:26:48,892 INFO L225 Difference]: With dead ends: 104 [2019-11-28 20:26:48,892 INFO L226 Difference]: Without dead ends: 91 [2019-11-28 20:26:48,893 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:26:48,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-28 20:26:48,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-11-28 20:26:48,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-28 20:26:48,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 120 transitions. [2019-11-28 20:26:48,903 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 120 transitions. Word has length 28 [2019-11-28 20:26:48,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:26:48,903 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 120 transitions. [2019-11-28 20:26:48,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:26:48,904 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 120 transitions. [2019-11-28 20:26:48,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 20:26:48,905 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:26:48,906 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:26:48,906 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:26:48,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:26:48,907 INFO L82 PathProgramCache]: Analyzing trace with hash -112425001, now seen corresponding path program 1 times [2019-11-28 20:26:48,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:26:48,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511245698] [2019-11-28 20:26:48,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:26:48,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:49,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:26:49,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511245698] [2019-11-28 20:26:49,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:26:49,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 20:26:49,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577879107] [2019-11-28 20:26:49,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 20:26:49,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:26:49,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:26:49,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:26:49,132 INFO L87 Difference]: Start difference. First operand 91 states and 120 transitions. Second operand 6 states. [2019-11-28 20:26:49,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:26:49,592 INFO L93 Difference]: Finished difference Result 278 states and 378 transitions. [2019-11-28 20:26:49,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:26:49,593 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-11-28 20:26:49,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:26:49,595 INFO L225 Difference]: With dead ends: 278 [2019-11-28 20:26:49,595 INFO L226 Difference]: Without dead ends: 215 [2019-11-28 20:26:49,596 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-28 20:26:49,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-11-28 20:26:49,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 129. [2019-11-28 20:26:49,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-11-28 20:26:49,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 164 transitions. [2019-11-28 20:26:49,608 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 164 transitions. Word has length 28 [2019-11-28 20:26:49,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:26:49,609 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 164 transitions. [2019-11-28 20:26:49,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 20:26:49,609 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 164 transitions. [2019-11-28 20:26:49,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 20:26:49,612 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:26:49,614 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:26:49,615 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:26:49,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:26:49,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1196873997, now seen corresponding path program 1 times [2019-11-28 20:26:49,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:26:49,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400843180] [2019-11-28 20:26:49,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:26:49,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:49,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:26:49,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400843180] [2019-11-28 20:26:49,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538124722] [2019-11-28 20:26:49,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:26:49,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:49,790 INFO L264 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:26:49,796 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:26:49,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:26:49,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 20:26:49,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-11-28 20:26:49,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652422621] [2019-11-28 20:26:49,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:26:49,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:26:49,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:26:49,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:26:49,884 INFO L87 Difference]: Start difference. First operand 129 states and 164 transitions. Second operand 4 states. [2019-11-28 20:26:50,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:26:50,172 INFO L93 Difference]: Finished difference Result 251 states and 358 transitions. [2019-11-28 20:26:50,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:26:50,173 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-11-28 20:26:50,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:26:50,175 INFO L225 Difference]: With dead ends: 251 [2019-11-28 20:26:50,175 INFO L226 Difference]: Without dead ends: 185 [2019-11-28 20:26:50,176 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:26:50,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-28 20:26:50,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 158. [2019-11-28 20:26:50,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-11-28 20:26:50,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 193 transitions. [2019-11-28 20:26:50,185 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 193 transitions. Word has length 31 [2019-11-28 20:26:50,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:26:50,186 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 193 transitions. [2019-11-28 20:26:50,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:26:50,186 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 193 transitions. [2019-11-28 20:26:50,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-28 20:26:50,188 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:26:50,188 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:26:50,393 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:26:50,397 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:26:50,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:26:50,398 INFO L82 PathProgramCache]: Analyzing trace with hash 885794486, now seen corresponding path program 1 times [2019-11-28 20:26:50,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:26:50,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165325065] [2019-11-28 20:26:50,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:26:50,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:50,572 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:26:50,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165325065] [2019-11-28 20:26:50,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976355990] [2019-11-28 20:26:50,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:26:50,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:50,645 INFO L264 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 20:26:50,647 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:26:50,688 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 20:26:50,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 20:26:50,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2019-11-28 20:26:50,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102665366] [2019-11-28 20:26:50,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:26:50,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:26:50,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:26:50,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-28 20:26:50,690 INFO L87 Difference]: Start difference. First operand 158 states and 193 transitions. Second operand 4 states. [2019-11-28 20:26:50,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:26:50,920 INFO L93 Difference]: Finished difference Result 337 states and 447 transitions. [2019-11-28 20:26:50,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:26:50,921 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2019-11-28 20:26:50,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:26:50,924 INFO L225 Difference]: With dead ends: 337 [2019-11-28 20:26:50,925 INFO L226 Difference]: Without dead ends: 227 [2019-11-28 20:26:50,925 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-28 20:26:50,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-11-28 20:26:50,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 190. [2019-11-28 20:26:50,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-11-28 20:26:50,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 229 transitions. [2019-11-28 20:26:50,939 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 229 transitions. Word has length 38 [2019-11-28 20:26:50,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:26:50,939 INFO L462 AbstractCegarLoop]: Abstraction has 190 states and 229 transitions. [2019-11-28 20:26:50,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:26:50,940 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 229 transitions. [2019-11-28 20:26:50,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 20:26:50,946 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:26:50,947 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:26:51,154 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:26:51,154 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:26:51,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:26:51,155 INFO L82 PathProgramCache]: Analyzing trace with hash -606603049, now seen corresponding path program 1 times [2019-11-28 20:26:51,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:26:51,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854175790] [2019-11-28 20:26:51,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:26:51,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:51,341 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 20:26:51,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854175790] [2019-11-28 20:26:51,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586750697] [2019-11-28 20:26:51,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:26:51,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:51,394 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 20:26:51,396 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:26:51,433 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 20:26:51,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 20:26:51,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2019-11-28 20:26:51,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623381874] [2019-11-28 20:26:51,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:26:51,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:26:51,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:26:51,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-28 20:26:51,435 INFO L87 Difference]: Start difference. First operand 190 states and 229 transitions. Second operand 4 states. [2019-11-28 20:26:51,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:26:51,690 INFO L93 Difference]: Finished difference Result 401 states and 517 transitions. [2019-11-28 20:26:51,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:26:51,690 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-11-28 20:26:51,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:26:51,692 INFO L225 Difference]: With dead ends: 401 [2019-11-28 20:26:51,692 INFO L226 Difference]: Without dead ends: 259 [2019-11-28 20:26:51,692 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-28 20:26:51,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-11-28 20:26:51,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 222. [2019-11-28 20:26:51,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-11-28 20:26:51,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 265 transitions. [2019-11-28 20:26:51,700 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 265 transitions. Word has length 45 [2019-11-28 20:26:51,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:26:51,700 INFO L462 AbstractCegarLoop]: Abstraction has 222 states and 265 transitions. [2019-11-28 20:26:51,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:26:51,700 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 265 transitions. [2019-11-28 20:26:51,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 20:26:51,701 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:26:51,701 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:26:51,905 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:26:51,906 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:26:51,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:26:51,906 INFO L82 PathProgramCache]: Analyzing trace with hash 491566034, now seen corresponding path program 1 times [2019-11-28 20:26:51,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:26:51,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888835063] [2019-11-28 20:26:51,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:26:51,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:51,994 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-28 20:26:51,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888835063] [2019-11-28 20:26:51,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:26:51,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:26:51,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868284473] [2019-11-28 20:26:51,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:26:51,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:26:51,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:26:51,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:26:51,998 INFO L87 Difference]: Start difference. First operand 222 states and 265 transitions. Second operand 3 states. [2019-11-28 20:26:52,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:26:52,012 INFO L93 Difference]: Finished difference Result 259 states and 306 transitions. [2019-11-28 20:26:52,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:26:52,013 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-28 20:26:52,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:26:52,018 INFO L225 Difference]: With dead ends: 259 [2019-11-28 20:26:52,018 INFO L226 Difference]: Without dead ends: 198 [2019-11-28 20:26:52,019 INFO L630 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 [2019-11-28 20:26:52,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-11-28 20:26:52,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 177. [2019-11-28 20:26:52,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-11-28 20:26:52,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 213 transitions. [2019-11-28 20:26:52,030 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 213 transitions. Word has length 52 [2019-11-28 20:26:52,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:26:52,030 INFO L462 AbstractCegarLoop]: Abstraction has 177 states and 213 transitions. [2019-11-28 20:26:52,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:26:52,031 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 213 transitions. [2019-11-28 20:26:52,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-28 20:26:52,032 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:26:52,032 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:26:52,035 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:26:52,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:26:52,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1569323720, now seen corresponding path program 1 times [2019-11-28 20:26:52,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:26:52,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527134427] [2019-11-28 20:26:52,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:26:52,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:52,133 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-28 20:26:52,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527134427] [2019-11-28 20:26:52,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:26:52,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 20:26:52,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700436997] [2019-11-28 20:26:52,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:26:52,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:26:52,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:26:52,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:26:52,136 INFO L87 Difference]: Start difference. First operand 177 states and 213 transitions. Second operand 4 states. [2019-11-28 20:26:52,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:26:52,223 INFO L93 Difference]: Finished difference Result 442 states and 535 transitions. [2019-11-28 20:26:52,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:26:52,223 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-11-28 20:26:52,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:26:52,226 INFO L225 Difference]: With dead ends: 442 [2019-11-28 20:26:52,226 INFO L226 Difference]: Without dead ends: 313 [2019-11-28 20:26:52,226 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:26:52,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-11-28 20:26:52,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 218. [2019-11-28 20:26:52,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2019-11-28 20:26:52,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 270 transitions. [2019-11-28 20:26:52,236 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 270 transitions. Word has length 61 [2019-11-28 20:26:52,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:26:52,236 INFO L462 AbstractCegarLoop]: Abstraction has 218 states and 270 transitions. [2019-11-28 20:26:52,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:26:52,237 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 270 transitions. [2019-11-28 20:26:52,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-28 20:26:52,238 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:26:52,238 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:26:52,239 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:26:52,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:26:52,239 INFO L82 PathProgramCache]: Analyzing trace with hash 481660278, now seen corresponding path program 2 times [2019-11-28 20:26:52,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:26:52,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856545611] [2019-11-28 20:26:52,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:26:52,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:52,352 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 53 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-28 20:26:52,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856545611] [2019-11-28 20:26:52,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [635524793] [2019-11-28 20:26:52,353 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:26:52,416 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 20:26:52,416 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:26:52,417 INFO L264 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 20:26:52,424 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:26:52,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:26:52,518 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 53 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-28 20:26:52,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:26:52,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-11-28 20:26:52,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579637472] [2019-11-28 20:26:52,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 20:26:52,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:26:52,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:26:52,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:26:52,520 INFO L87 Difference]: Start difference. First operand 218 states and 270 transitions. Second operand 6 states. [2019-11-28 20:26:52,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:26:52,760 INFO L93 Difference]: Finished difference Result 493 states and 615 transitions. [2019-11-28 20:26:52,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 20:26:52,760 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-11-28 20:26:52,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:26:52,763 INFO L225 Difference]: With dead ends: 493 [2019-11-28 20:26:52,763 INFO L226 Difference]: Without dead ends: 323 [2019-11-28 20:26:52,764 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-28 20:26:52,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-11-28 20:26:52,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 221. [2019-11-28 20:26:52,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-11-28 20:26:52,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 273 transitions. [2019-11-28 20:26:52,774 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 273 transitions. Word has length 61 [2019-11-28 20:26:52,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:26:52,775 INFO L462 AbstractCegarLoop]: Abstraction has 221 states and 273 transitions. [2019-11-28 20:26:52,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 20:26:52,775 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 273 transitions. [2019-11-28 20:26:52,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-28 20:26:52,776 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:26:52,776 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:26:52,981 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:26:52,981 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:26:52,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:26:52,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1399599652, now seen corresponding path program 1 times [2019-11-28 20:26:52,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:26:52,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221318983] [2019-11-28 20:26:52,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:26:52,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:53,182 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 44 proven. 7 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-28 20:26:53,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221318983] [2019-11-28 20:26:53,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920639660] [2019-11-28 20:26:53,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:26:53,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:53,232 INFO L264 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:26:53,240 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:26:53,276 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 44 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-28 20:26:53,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:26:53,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 9 [2019-11-28 20:26:53,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026667888] [2019-11-28 20:26:53,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 20:26:53,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:26:53,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 20:26:53,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:26:53,278 INFO L87 Difference]: Start difference. First operand 221 states and 273 transitions. Second operand 9 states. [2019-11-28 20:26:53,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:26:53,670 INFO L93 Difference]: Finished difference Result 584 states and 733 transitions. [2019-11-28 20:26:53,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 20:26:53,671 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-11-28 20:26:53,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:26:53,674 INFO L225 Difference]: With dead ends: 584 [2019-11-28 20:26:53,674 INFO L226 Difference]: Without dead ends: 406 [2019-11-28 20:26:53,675 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 66 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-11-28 20:26:53,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-11-28 20:26:53,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 344. [2019-11-28 20:26:53,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-11-28 20:26:53,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 422 transitions. [2019-11-28 20:26:53,695 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 422 transitions. Word has length 67 [2019-11-28 20:26:53,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:26:53,696 INFO L462 AbstractCegarLoop]: Abstraction has 344 states and 422 transitions. [2019-11-28 20:26:53,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 20:26:53,697 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 422 transitions. [2019-11-28 20:26:53,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-28 20:26:53,698 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:26:53,699 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:26:53,912 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:26:53,913 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:26:53,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:26:53,914 INFO L82 PathProgramCache]: Analyzing trace with hash 642833928, now seen corresponding path program 1 times [2019-11-28 20:26:53,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:26:53,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193759469] [2019-11-28 20:26:53,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:26:53,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:54,096 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-28 20:26:54,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193759469] [2019-11-28 20:26:54,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:26:54,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 20:26:54,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883048430] [2019-11-28 20:26:54,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 20:26:54,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:26:54,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 20:26:54,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-28 20:26:54,098 INFO L87 Difference]: Start difference. First operand 344 states and 422 transitions. Second operand 8 states. [2019-11-28 20:26:54,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:26:54,709 INFO L93 Difference]: Finished difference Result 976 states and 1208 transitions. [2019-11-28 20:26:54,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 20:26:54,710 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67 [2019-11-28 20:26:54,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:26:54,714 INFO L225 Difference]: With dead ends: 976 [2019-11-28 20:26:54,714 INFO L226 Difference]: Without dead ends: 627 [2019-11-28 20:26:54,716 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2019-11-28 20:26:54,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2019-11-28 20:26:54,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 541. [2019-11-28 20:26:54,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2019-11-28 20:26:54,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 673 transitions. [2019-11-28 20:26:54,742 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 673 transitions. Word has length 67 [2019-11-28 20:26:54,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:26:54,743 INFO L462 AbstractCegarLoop]: Abstraction has 541 states and 673 transitions. [2019-11-28 20:26:54,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 20:26:54,743 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 673 transitions. [2019-11-28 20:26:54,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-28 20:26:54,744 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:26:54,745 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:26:54,745 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:26:54,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:26:54,745 INFO L82 PathProgramCache]: Analyzing trace with hash 127965796, now seen corresponding path program 1 times [2019-11-28 20:26:54,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:26:54,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553733005] [2019-11-28 20:26:54,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:26:54,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:54,858 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 39 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-28 20:26:54,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553733005] [2019-11-28 20:26:54,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452031847] [2019-11-28 20:26:54,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:26:54,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:54,926 INFO L264 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 20:26:54,937 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:26:54,976 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-11-28 20:26:54,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:26:54,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 7 [2019-11-28 20:26:54,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653692863] [2019-11-28 20:26:54,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 20:26:54,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:26:54,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 20:26:54,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:26:54,979 INFO L87 Difference]: Start difference. First operand 541 states and 673 transitions. Second operand 7 states. [2019-11-28 20:26:55,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:26:55,776 INFO L93 Difference]: Finished difference Result 1476 states and 1835 transitions. [2019-11-28 20:26:55,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 20:26:55,777 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2019-11-28 20:26:55,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:26:55,781 INFO L225 Difference]: With dead ends: 1476 [2019-11-28 20:26:55,782 INFO L226 Difference]: Without dead ends: 886 [2019-11-28 20:26:55,785 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2019-11-28 20:26:55,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2019-11-28 20:26:55,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 438. [2019-11-28 20:26:55,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2019-11-28 20:26:55,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 577 transitions. [2019-11-28 20:26:55,805 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 577 transitions. Word has length 73 [2019-11-28 20:26:55,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:26:55,805 INFO L462 AbstractCegarLoop]: Abstraction has 438 states and 577 transitions. [2019-11-28 20:26:55,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 20:26:55,806 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 577 transitions. [2019-11-28 20:26:55,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-28 20:26:55,810 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:26:55,811 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:26:56,015 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:26:56,017 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:26:56,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:26:56,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1286610050, now seen corresponding path program 1 times [2019-11-28 20:26:56,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:26:56,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981945013] [2019-11-28 20:26:56,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:26:56,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:56,145 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-11-28 20:26:56,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981945013] [2019-11-28 20:26:56,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:26:56,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 20:26:56,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015608301] [2019-11-28 20:26:56,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 20:26:56,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:26:56,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 20:26:56,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:26:56,147 INFO L87 Difference]: Start difference. First operand 438 states and 577 transitions. Second operand 7 states. [2019-11-28 20:26:56,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:26:56,767 INFO L93 Difference]: Finished difference Result 1486 states and 2011 transitions. [2019-11-28 20:26:56,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 20:26:56,768 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 79 [2019-11-28 20:26:56,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:26:56,774 INFO L225 Difference]: With dead ends: 1486 [2019-11-28 20:26:56,774 INFO L226 Difference]: Without dead ends: 1092 [2019-11-28 20:26:56,775 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-11-28 20:26:56,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2019-11-28 20:26:56,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 888. [2019-11-28 20:26:56,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 888 states. [2019-11-28 20:26:56,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1202 transitions. [2019-11-28 20:26:56,810 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1202 transitions. Word has length 79 [2019-11-28 20:26:56,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:26:56,810 INFO L462 AbstractCegarLoop]: Abstraction has 888 states and 1202 transitions. [2019-11-28 20:26:56,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 20:26:56,810 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1202 transitions. [2019-11-28 20:26:56,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-28 20:26:56,812 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:26:56,812 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:26:56,812 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:26:56,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:26:56,813 INFO L82 PathProgramCache]: Analyzing trace with hash -56372555, now seen corresponding path program 1 times [2019-11-28 20:26:56,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:26:56,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40602373] [2019-11-28 20:26:56,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:26:56,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:56,950 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-11-28 20:26:56,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40602373] [2019-11-28 20:26:56,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:26:56,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 20:26:56,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341019127] [2019-11-28 20:26:56,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 20:26:56,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:26:56,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:26:56,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:26:56,954 INFO L87 Difference]: Start difference. First operand 888 states and 1202 transitions. Second operand 6 states. [2019-11-28 20:26:57,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:26:57,237 INFO L93 Difference]: Finished difference Result 2376 states and 3128 transitions. [2019-11-28 20:26:57,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:26:57,238 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2019-11-28 20:26:57,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:26:57,250 INFO L225 Difference]: With dead ends: 2376 [2019-11-28 20:26:57,251 INFO L226 Difference]: Without dead ends: 1512 [2019-11-28 20:26:57,254 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-28 20:26:57,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2019-11-28 20:26:57,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1060. [2019-11-28 20:26:57,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1060 states. [2019-11-28 20:26:57,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 1382 transitions. [2019-11-28 20:26:57,331 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 1382 transitions. Word has length 82 [2019-11-28 20:26:57,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:26:57,332 INFO L462 AbstractCegarLoop]: Abstraction has 1060 states and 1382 transitions. [2019-11-28 20:26:57,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 20:26:57,332 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1382 transitions. [2019-11-28 20:26:57,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-28 20:26:57,334 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:26:57,335 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:26:57,335 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:26:57,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:26:57,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1721162641, now seen corresponding path program 1 times [2019-11-28 20:26:57,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:26:57,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295891134] [2019-11-28 20:26:57,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:26:57,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:57,529 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-11-28 20:26:57,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295891134] [2019-11-28 20:26:57,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:26:57,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 20:26:57,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932469636] [2019-11-28 20:26:57,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 20:26:57,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:26:57,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 20:26:57,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-28 20:26:57,533 INFO L87 Difference]: Start difference. First operand 1060 states and 1382 transitions. Second operand 8 states. [2019-11-28 20:26:58,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:26:58,666 INFO L93 Difference]: Finished difference Result 2563 states and 3343 transitions. [2019-11-28 20:26:58,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 20:26:58,666 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2019-11-28 20:26:58,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:26:58,673 INFO L225 Difference]: With dead ends: 2563 [2019-11-28 20:26:58,674 INFO L226 Difference]: Without dead ends: 1520 [2019-11-28 20:26:58,676 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2019-11-28 20:26:58,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2019-11-28 20:26:58,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 1284. [2019-11-28 20:26:58,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1284 states. [2019-11-28 20:26:58,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1284 states to 1284 states and 1669 transitions. [2019-11-28 20:26:58,722 INFO L78 Accepts]: Start accepts. Automaton has 1284 states and 1669 transitions. Word has length 82 [2019-11-28 20:26:58,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:26:58,722 INFO L462 AbstractCegarLoop]: Abstraction has 1284 states and 1669 transitions. [2019-11-28 20:26:58,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 20:26:58,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1284 states and 1669 transitions. [2019-11-28 20:26:58,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-28 20:26:58,724 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:26:58,725 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:26:58,725 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:26:58,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:26:58,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1869916981, now seen corresponding path program 1 times [2019-11-28 20:26:58,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:26:58,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420150844] [2019-11-28 20:26:58,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:26:58,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:58,876 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-11-28 20:26:58,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420150844] [2019-11-28 20:26:58,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:26:58,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-28 20:26:58,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674330647] [2019-11-28 20:26:58,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 20:26:58,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:26:58,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 20:26:58,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:26:58,879 INFO L87 Difference]: Start difference. First operand 1284 states and 1669 transitions. Second operand 9 states. [2019-11-28 20:26:59,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:26:59,705 INFO L93 Difference]: Finished difference Result 2347 states and 3046 transitions. [2019-11-28 20:26:59,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 20:26:59,705 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-11-28 20:26:59,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:26:59,711 INFO L225 Difference]: With dead ends: 2347 [2019-11-28 20:26:59,712 INFO L226 Difference]: Without dead ends: 1084 [2019-11-28 20:26:59,714 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-11-28 20:26:59,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2019-11-28 20:26:59,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 943. [2019-11-28 20:26:59,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 943 states. [2019-11-28 20:26:59,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1219 transitions. [2019-11-28 20:26:59,756 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1219 transitions. Word has length 84 [2019-11-28 20:26:59,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:26:59,756 INFO L462 AbstractCegarLoop]: Abstraction has 943 states and 1219 transitions. [2019-11-28 20:26:59,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 20:26:59,756 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1219 transitions. [2019-11-28 20:26:59,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-28 20:26:59,760 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:26:59,760 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:26:59,761 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:26:59,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:26:59,761 INFO L82 PathProgramCache]: Analyzing trace with hash 344699391, now seen corresponding path program 1 times [2019-11-28 20:26:59,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:26:59,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12439095] [2019-11-28 20:26:59,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:26:59,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:00,015 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 56 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-28 20:27:00,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12439095] [2019-11-28 20:27:00,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361068221] [2019-11-28 20:27:00,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:27:00,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:00,103 INFO L264 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-28 20:27:00,106 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:27:00,192 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 56 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-28 20:27:00,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:27:00,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2019-11-28 20:27:00,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015257018] [2019-11-28 20:27:00,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 20:27:00,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:00,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 20:27:00,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-11-28 20:27:00,200 INFO L87 Difference]: Start difference. First operand 943 states and 1219 transitions. Second operand 11 states. [2019-11-28 20:27:00,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:00,414 INFO L93 Difference]: Finished difference Result 1321 states and 1624 transitions. [2019-11-28 20:27:00,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 20:27:00,414 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 90 [2019-11-28 20:27:00,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:00,420 INFO L225 Difference]: With dead ends: 1321 [2019-11-28 20:27:00,420 INFO L226 Difference]: Without dead ends: 1123 [2019-11-28 20:27:00,421 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-11-28 20:27:00,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2019-11-28 20:27:00,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 841. [2019-11-28 20:27:00,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 841 states. [2019-11-28 20:27:00,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1086 transitions. [2019-11-28 20:27:00,454 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1086 transitions. Word has length 90 [2019-11-28 20:27:00,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:00,454 INFO L462 AbstractCegarLoop]: Abstraction has 841 states and 1086 transitions. [2019-11-28 20:27:00,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 20:27:00,454 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1086 transitions. [2019-11-28 20:27:00,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-28 20:27:00,456 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:00,456 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:27:00,661 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:27:00,661 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:00,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:00,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1999362949, now seen corresponding path program 2 times [2019-11-28 20:27:00,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:00,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249895726] [2019-11-28 20:27:00,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:00,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:00,783 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-28 20:27:00,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249895726] [2019-11-28 20:27:00,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113362202] [2019-11-28 20:27:00,785 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:27:00,873 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 20:27:00,873 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:27:00,874 INFO L264 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-28 20:27:00,876 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:27:01,044 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 44 proven. 28 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-28 20:27:01,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:27:01,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2019-11-28 20:27:01,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509246997] [2019-11-28 20:27:01,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 20:27:01,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:01,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 20:27:01,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-11-28 20:27:01,046 INFO L87 Difference]: Start difference. First operand 841 states and 1086 transitions. Second operand 12 states. [2019-11-28 20:27:01,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:01,841 INFO L93 Difference]: Finished difference Result 3051 states and 3643 transitions. [2019-11-28 20:27:01,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 20:27:01,841 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 90 [2019-11-28 20:27:01,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:01,852 INFO L225 Difference]: With dead ends: 3051 [2019-11-28 20:27:01,852 INFO L226 Difference]: Without dead ends: 2647 [2019-11-28 20:27:01,854 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=302, Unknown=0, NotChecked=0, Total=420 [2019-11-28 20:27:01,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2647 states. [2019-11-28 20:27:01,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2647 to 742. [2019-11-28 20:27:01,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 742 states. [2019-11-28 20:27:01,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 964 transitions. [2019-11-28 20:27:01,895 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 964 transitions. Word has length 90 [2019-11-28 20:27:01,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:01,896 INFO L462 AbstractCegarLoop]: Abstraction has 742 states and 964 transitions. [2019-11-28 20:27:01,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 20:27:01,896 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 964 transitions. [2019-11-28 20:27:01,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-28 20:27:01,897 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:01,898 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:27:02,101 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:27:02,105 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:02,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:02,106 INFO L82 PathProgramCache]: Analyzing trace with hash 114949769, now seen corresponding path program 1 times [2019-11-28 20:27:02,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:02,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456405804] [2019-11-28 20:27:02,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:02,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:02,294 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 67 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-28 20:27:02,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456405804] [2019-11-28 20:27:02,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982345649] [2019-11-28 20:27:02,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:27:02,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:02,357 INFO L264 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-28 20:27:02,359 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:27:02,434 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 24 proven. 35 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-11-28 20:27:02,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:27:02,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 11 [2019-11-28 20:27:02,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93806350] [2019-11-28 20:27:02,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 20:27:02,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:02,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 20:27:02,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-11-28 20:27:02,437 INFO L87 Difference]: Start difference. First operand 742 states and 964 transitions. Second operand 12 states. [2019-11-28 20:27:03,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:03,315 INFO L93 Difference]: Finished difference Result 2031 states and 2503 transitions. [2019-11-28 20:27:03,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 20:27:03,317 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 94 [2019-11-28 20:27:03,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:03,320 INFO L225 Difference]: With dead ends: 2031 [2019-11-28 20:27:03,320 INFO L226 Difference]: Without dead ends: 747 [2019-11-28 20:27:03,322 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=347, Unknown=0, NotChecked=0, Total=462 [2019-11-28 20:27:03,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2019-11-28 20:27:03,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 244. [2019-11-28 20:27:03,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2019-11-28 20:27:03,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 320 transitions. [2019-11-28 20:27:03,335 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 320 transitions. Word has length 94 [2019-11-28 20:27:03,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:03,335 INFO L462 AbstractCegarLoop]: Abstraction has 244 states and 320 transitions. [2019-11-28 20:27:03,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 20:27:03,335 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 320 transitions. [2019-11-28 20:27:03,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-28 20:27:03,336 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:03,337 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:27:03,540 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:27:03,549 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:03,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:03,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1499605514, now seen corresponding path program 1 times [2019-11-28 20:27:03,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:03,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182146227] [2019-11-28 20:27:03,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:03,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:27:03,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:27:03,680 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:27:03,681 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 20:27:03,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:27:03 BoogieIcfgContainer [2019-11-28 20:27:03,752 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 20:27:03,753 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:27:03,753 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:27:03,753 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:27:03,753 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:26:47" (3/4) ... [2019-11-28 20:27:03,760 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 20:27:03,760 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:27:03,763 INFO L168 Benchmark]: Toolchain (without parser) took 17964.10 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 347.1 MB). Free memory was 956.3 MB in the beginning and 931.4 MB in the end (delta: 24.9 MB). Peak memory consumption was 372.0 MB. Max. memory is 11.5 GB. [2019-11-28 20:27:03,763 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:27:03,764 INFO L168 Benchmark]: CACSL2BoogieTranslator took 370.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -173.4 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. [2019-11-28 20:27:03,764 INFO L168 Benchmark]: Boogie Procedure Inliner took 84.89 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:27:03,766 INFO L168 Benchmark]: Boogie Preprocessor took 71.72 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:27:03,770 INFO L168 Benchmark]: RCFGBuilder took 846.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.3 MB). Peak memory consumption was 32.3 MB. Max. memory is 11.5 GB. [2019-11-28 20:27:03,770 INFO L168 Benchmark]: TraceAbstraction took 16578.46 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 207.6 MB). Free memory was 1.1 GB in the beginning and 931.4 MB in the end (delta: 159.4 MB). Peak memory consumption was 367.0 MB. Max. memory is 11.5 GB. [2019-11-28 20:27:03,770 INFO L168 Benchmark]: Witness Printer took 7.45 ms. Allocated memory is still 1.4 GB. Free memory is still 931.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:27:03,774 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 370.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -173.4 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 84.89 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 71.72 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 846.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.3 MB). Peak memory consumption was 32.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16578.46 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 207.6 MB). Free memory was 1.1 GB in the beginning and 931.4 MB in the end (delta: 159.4 MB). Peak memory consumption was 367.0 MB. Max. memory is 11.5 GB. * Witness Printer took 7.45 ms. Allocated memory is still 1.4 GB. Free memory is still 931.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 97]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseAnd at line 77. Possible FailurePath: [L105] unsigned int a, b, r; [L107] b = __VERIFIER_nondet_uint() [L109] a = 234770789 [L23] unsigned char a0, a1, a2, a3; [L24] unsigned char b0, b1, b2, b3; [L25] unsigned char r0, r1, r2, r3; [L26] unsigned short carry; [L27] unsigned short partial_sum; [L28] unsigned int r; [L29] unsigned char i; [L30] unsigned char na, nb; [L31] a0 = a [L32] a1 = a >> 8 [L33] a2 = a >> 16U [L34] a3 = a >> 24U [L35] b0 = b [L36] b1 = b >> 8U [L37] b2 = b >> 16U [L38] b3 = b >> 24U [L39] na = (unsigned char)4 [L40] COND FALSE !(a3 == (unsigned char)0) [L49] nb = (unsigned char)4 [L50] COND FALSE !(b3 == (unsigned char)0) [L59] carry = (unsigned short)0 [L60] i = (unsigned char)0 [L61] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L62] partial_sum = carry [L63] carry = (unsigned short)0 [L64] COND TRUE i < na [L65] COND TRUE i == (unsigned char)0 [L65] EXPR partial_sum + a0 [L65] partial_sum = partial_sum + a0 [L66] COND FALSE !(i == (unsigned char)1) [L67] COND FALSE !(i == (unsigned char)2) [L68] COND FALSE !(i == (unsigned char)3) [L70] COND TRUE i < nb [L71] COND TRUE i == (unsigned char)0 [L71] EXPR partial_sum + b0 [L71] partial_sum = partial_sum + b0 [L72] COND FALSE !(i == (unsigned char)1) [L73] COND FALSE !(i == (unsigned char)2) [L74] COND FALSE !(i == (unsigned char)3) [L76] COND TRUE partial_sum > ((unsigned char)255) [L77] partial_sum = partial_sum & ((unsigned char)255) [L78] carry = (unsigned short)1 [L80] COND TRUE i == (unsigned char)0 [L80] r0 = (unsigned char)partial_sum [L81] COND FALSE !(i == (unsigned char)1) [L82] COND FALSE !(i == (unsigned char)2) [L83] COND FALSE !(i == (unsigned char)3) [L85] EXPR i + (unsigned char)1 [L85] i = i + (unsigned char)1 [L61] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L62] partial_sum = carry [L63] carry = (unsigned short)0 [L64] COND TRUE i < na [L65] COND FALSE !(i == (unsigned char)0) [L66] COND TRUE i == (unsigned char)1 [L66] EXPR partial_sum + a1 [L66] partial_sum = partial_sum + a1 [L67] COND FALSE !(i == (unsigned char)2) [L68] COND FALSE !(i == (unsigned char)3) [L70] COND TRUE i < nb [L71] COND FALSE !(i == (unsigned char)0) [L72] COND TRUE i == (unsigned char)1 [L72] EXPR partial_sum + b1 [L72] partial_sum = partial_sum + b1 [L73] COND FALSE !(i == (unsigned char)2) [L74] COND FALSE !(i == (unsigned char)3) [L76] COND TRUE partial_sum > ((unsigned char)255) [L77] partial_sum = partial_sum & ((unsigned char)255) [L78] carry = (unsigned short)1 [L80] COND FALSE !(i == (unsigned char)0) [L81] COND TRUE i == (unsigned char)1 [L81] r1 = (unsigned char)partial_sum [L82] COND FALSE !(i == (unsigned char)2) [L83] COND FALSE !(i == (unsigned char)3) [L85] EXPR i + (unsigned char)1 [L85] i = i + (unsigned char)1 [L61] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L62] partial_sum = carry [L63] carry = (unsigned short)0 [L64] COND TRUE i < na [L65] COND FALSE !(i == (unsigned char)0) [L66] COND FALSE !(i == (unsigned char)1) [L67] COND TRUE i == (unsigned char)2 [L67] EXPR partial_sum + a2 [L67] partial_sum = partial_sum + a2 [L68] COND FALSE !(i == (unsigned char)3) [L70] COND TRUE i < nb [L71] COND FALSE !(i == (unsigned char)0) [L72] COND FALSE !(i == (unsigned char)1) [L73] COND TRUE i == (unsigned char)2 [L73] EXPR partial_sum + b2 [L73] partial_sum = partial_sum + b2 [L74] COND FALSE !(i == (unsigned char)3) [L76] COND TRUE partial_sum > ((unsigned char)255) [L77] partial_sum = partial_sum & ((unsigned char)255) [L78] carry = (unsigned short)1 [L80] COND FALSE !(i == (unsigned char)0) [L81] COND FALSE !(i == (unsigned char)1) [L82] COND TRUE i == (unsigned char)2 [L82] r2 = (unsigned char)partial_sum [L83] COND FALSE !(i == (unsigned char)3) [L85] EXPR i + (unsigned char)1 [L85] i = i + (unsigned char)1 [L61] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L62] partial_sum = carry [L63] carry = (unsigned short)0 [L64] COND TRUE i < na [L65] COND FALSE !(i == (unsigned char)0) [L66] COND FALSE !(i == (unsigned char)1) [L67] COND FALSE !(i == (unsigned char)2) [L68] COND TRUE i == (unsigned char)3 [L68] EXPR partial_sum + a3 [L68] partial_sum = partial_sum + a3 [L70] COND TRUE i < nb [L71] COND FALSE !(i == (unsigned char)0) [L72] COND FALSE !(i == (unsigned char)1) [L73] COND FALSE !(i == (unsigned char)2) [L74] COND TRUE i == (unsigned char)3 [L74] EXPR partial_sum + b3 [L74] partial_sum = partial_sum + b3 [L76] COND FALSE !(partial_sum > ((unsigned char)255)) [L80] COND FALSE !(i == (unsigned char)0) [L81] COND FALSE !(i == (unsigned char)1) [L82] COND FALSE !(i == (unsigned char)2) [L83] COND TRUE i == (unsigned char)3 [L83] r3 = (unsigned char)partial_sum [L85] EXPR i + (unsigned char)1 [L85] i = i + (unsigned char)1 [L61] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) [L88] COND FALSE !(i < (unsigned char)4) [L97] r1 << 8U [L97] r2 << 16U [L97] r3 << 24U - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 113 locations, 38 error locations. Result: UNSAFE, OverallTime: 16.4s, OverallIterations: 23, TraceHistogramMax: 4, AutomataDifference: 9.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2156 SDtfs, 4074 SDslu, 5007 SDs, 0 SdLazy, 5605 SolverSat, 432 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 784 GetRequests, 600 SyntacticMatches, 18 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1284occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 22 MinimizatonAttempts, 4795 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 1897 NumberOfCodeBlocks, 1897 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1766 ConstructedInterpolants, 19 QuantifiedInterpolants, 578378 SizeOfPredicates, 27 NumberOfNonLiveVariables, 1334 ConjunctsInSsa, 95 ConjunctsInUnsatCore, 31 InterpolantComputations, 16 PerfectInterpolantSequences, 1293/1483 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...