./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 64bit --witnessprinter.graph.data.programhash ac99a20a7aff68d4303ed37ca9ad8305a1f8cf0d ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 20:23:17,358 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:23:17,362 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:23:17,379 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:23:17,380 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:23:17,382 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:23:17,385 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:23:17,396 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:23:17,402 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:23:17,405 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:23:17,406 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:23:17,408 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:23:17,409 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:23:17,413 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:23:17,415 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:23:17,417 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:23:17,419 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:23:17,421 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:23:17,424 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:23:17,428 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:23:17,432 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:23:17,437 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:23:17,439 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:23:17,440 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:23:17,443 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:23:17,443 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:23:17,444 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:23:17,446 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:23:17,446 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:23:17,447 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:23:17,448 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:23:17,448 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:23:17,449 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:23:17,451 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:23:17,452 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:23:17,452 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:23:17,454 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:23:17,454 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:23:17,454 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:23:17,455 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:23:17,457 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:23:17,458 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-11-28 20:23:17,490 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:23:17,491 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:23:17,492 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:23:17,492 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:23:17,492 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:23:17,494 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:23:17,496 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:23:17,496 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:23:17,496 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:23:17,496 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 20:23:17,496 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 20:23:17,497 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 20:23:17,497 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-11-28 20:23:17,497 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 20:23:17,497 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:23:17,497 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 20:23:17,499 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:23:17,499 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:23:17,499 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 20:23:17,500 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 20:23:17,500 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 20:23:17,500 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:23:17,501 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 20:23:17,501 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 20:23:17,502 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:23:17,502 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 20:23:17,502 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 20:23:17,502 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:23:17,503 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ac99a20a7aff68d4303ed37ca9ad8305a1f8cf0d [2019-11-28 20:23:17,818 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:23:17,831 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:23:17,835 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:23:17,837 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:23:17,837 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:23:17,838 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c [2019-11-28 20:23:17,915 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8461d51d1/a996a82b856e44b59d5d3b38f86d094f/FLAG5820b3cd8 [2019-11-28 20:23:18,355 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:23:18,356 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c [2019-11-28 20:23:18,363 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8461d51d1/a996a82b856e44b59d5d3b38f86d094f/FLAG5820b3cd8 [2019-11-28 20:23:18,732 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8461d51d1/a996a82b856e44b59d5d3b38f86d094f [2019-11-28 20:23:18,736 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:23:18,737 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 20:23:18,738 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:23:18,738 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:23:18,742 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:23:18,743 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:23:18" (1/1) ... [2019-11-28 20:23:18,746 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42b24835 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:23:18, skipping insertion in model container [2019-11-28 20:23:18,747 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:23:18" (1/1) ... [2019-11-28 20:23:18,754 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:23:18,771 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:23:18,945 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:23:18,950 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:23:18,970 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:23:18,985 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:23:18,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:23:18 WrapperNode [2019-11-28 20:23:18,987 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:23:18,988 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 20:23:18,988 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 20:23:18,988 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 20:23:18,998 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:23:18" (1/1) ... [2019-11-28 20:23:19,005 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:23:18" (1/1) ... [2019-11-28 20:23:19,028 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 20:23:19,029 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:23:19,029 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:23:19,029 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:23:19,096 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:23:18" (1/1) ... [2019-11-28 20:23:19,097 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:23:18" (1/1) ... [2019-11-28 20:23:19,101 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:23:18" (1/1) ... [2019-11-28 20:23:19,101 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:23:18" (1/1) ... [2019-11-28 20:23:19,104 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:23:18" (1/1) ... [2019-11-28 20:23:19,110 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:23:18" (1/1) ... [2019-11-28 20:23:19,111 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:23:18" (1/1) ... [2019-11-28 20:23:19,113 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:23:19,113 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:23:19,113 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:23:19,114 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:23:19,115 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:23:18" (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:23:19,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:23:19,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:23:19,384 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:23:19,385 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-28 20:23:19,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:23:19 BoogieIcfgContainer [2019-11-28 20:23:19,386 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:23:19,388 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 20:23:19,388 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 20:23:19,391 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 20:23:19,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:23:18" (1/3) ... [2019-11-28 20:23:19,393 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2828258c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:23:19, skipping insertion in model container [2019-11-28 20:23:19,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:23:18" (2/3) ... [2019-11-28 20:23:19,393 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2828258c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:23:19, skipping insertion in model container [2019-11-28 20:23:19,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:23:19" (3/3) ... [2019-11-28 20:23:19,395 INFO L109 eAbstractionObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c [2019-11-28 20:23:19,407 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 20:23:19,415 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2019-11-28 20:23:19,430 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-11-28 20:23:19,461 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 20:23:19,461 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 20:23:19,461 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 20:23:19,462 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:23:19,462 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:23:19,463 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 20:23:19,463 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:23:19,463 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 20:23:19,487 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2019-11-28 20:23:19,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-28 20:23:19,494 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:23:19,495 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-28 20:23:19,496 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:23:19,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:23:19,506 INFO L82 PathProgramCache]: Analyzing trace with hash 29685899, now seen corresponding path program 1 times [2019-11-28 20:23:19,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:23:19,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209606887] [2019-11-28 20:23:19,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:23:19,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:23:19,646 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:23:19,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209606887] [2019-11-28 20:23:19,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:23:19,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:23:19,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549367690] [2019-11-28 20:23:19,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 20:23:19,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:23:19,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 20:23:19,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 20:23:19,668 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 2 states. [2019-11-28 20:23:19,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:23:19,685 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2019-11-28 20:23:19,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 20:23:19,687 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2019-11-28 20:23:19,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:23:19,696 INFO L225 Difference]: With dead ends: 50 [2019-11-28 20:23:19,697 INFO L226 Difference]: Without dead ends: 22 [2019-11-28 20:23:19,700 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 20:23:19,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-11-28 20:23:19,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-11-28 20:23:19,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-28 20:23:19,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-11-28 20:23:19,731 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 5 [2019-11-28 20:23:19,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:23:19,731 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-11-28 20:23:19,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 20:23:19,731 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-11-28 20:23:19,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-28 20:23:19,732 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:23:19,732 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-28 20:23:19,733 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:23:19,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:23:19,733 INFO L82 PathProgramCache]: Analyzing trace with hash 29685000, now seen corresponding path program 1 times [2019-11-28 20:23:19,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:23:19,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946537385] [2019-11-28 20:23:19,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:23:19,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:23:19,781 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:23:19,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946537385] [2019-11-28 20:23:19,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:23:19,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:23:19,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817908258] [2019-11-28 20:23:19,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:23:19,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:23:19,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:23:19,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:23:19,785 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 3 states. [2019-11-28 20:23:19,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:23:19,839 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2019-11-28 20:23:19,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:23:19,840 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-11-28 20:23:19,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:23:19,842 INFO L225 Difference]: With dead ends: 41 [2019-11-28 20:23:19,842 INFO L226 Difference]: Without dead ends: 40 [2019-11-28 20:23:19,843 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:23:19,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-28 20:23:19,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 25. [2019-11-28 20:23:19,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-28 20:23:19,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2019-11-28 20:23:19,851 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 5 [2019-11-28 20:23:19,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:23:19,851 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-11-28 20:23:19,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:23:19,852 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2019-11-28 20:23:19,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-28 20:23:19,852 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:23:19,853 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-28 20:23:19,853 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:23:19,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:23:19,854 INFO L82 PathProgramCache]: Analyzing trace with hash 29685034, now seen corresponding path program 1 times [2019-11-28 20:23:19,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:23:19,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069102037] [2019-11-28 20:23:19,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:23:19,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:23:19,886 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:23:19,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069102037] [2019-11-28 20:23:19,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:23:19,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:23:19,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105634063] [2019-11-28 20:23:19,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:23:19,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:23:19,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:23:19,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:23:19,889 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 3 states. [2019-11-28 20:23:19,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:23:19,932 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2019-11-28 20:23:19,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:23:19,933 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-11-28 20:23:19,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:23:19,934 INFO L225 Difference]: With dead ends: 34 [2019-11-28 20:23:19,934 INFO L226 Difference]: Without dead ends: 33 [2019-11-28 20:23:19,935 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:23:19,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-11-28 20:23:19,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2019-11-28 20:23:19,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-28 20:23:19,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-11-28 20:23:19,942 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 5 [2019-11-28 20:23:19,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:23:19,942 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-11-28 20:23:19,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:23:19,943 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2019-11-28 20:23:19,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-28 20:23:19,943 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:23:19,944 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-28 20:23:19,944 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:23:19,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:23:19,944 INFO L82 PathProgramCache]: Analyzing trace with hash 920235084, now seen corresponding path program 1 times [2019-11-28 20:23:19,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:23:19,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427659538] [2019-11-28 20:23:19,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:23:19,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:23:19,979 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:23:19,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427659538] [2019-11-28 20:23:19,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:23:19,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:23:19,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367826621] [2019-11-28 20:23:19,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:23:19,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:23:19,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:23:19,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:23:19,983 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 3 states. [2019-11-28 20:23:20,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:23:20,017 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2019-11-28 20:23:20,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:23:20,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-11-28 20:23:20,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:23:20,019 INFO L225 Difference]: With dead ends: 45 [2019-11-28 20:23:20,019 INFO L226 Difference]: Without dead ends: 44 [2019-11-28 20:23:20,020 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:23:20,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-28 20:23:20,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 31. [2019-11-28 20:23:20,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-28 20:23:20,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2019-11-28 20:23:20,028 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 6 [2019-11-28 20:23:20,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:23:20,028 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2019-11-28 20:23:20,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:23:20,029 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2019-11-28 20:23:20,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-28 20:23:20,029 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:23:20,029 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-28 20:23:20,030 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:23:20,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:23:20,031 INFO L82 PathProgramCache]: Analyzing trace with hash 920236110, now seen corresponding path program 1 times [2019-11-28 20:23:20,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:23:20,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198348678] [2019-11-28 20:23:20,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:23:20,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:23:20,099 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:23:20,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198348678] [2019-11-28 20:23:20,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:23:20,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:23:20,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2157531] [2019-11-28 20:23:20,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:23:20,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:23:20,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:23:20,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:23:20,104 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand 3 states. [2019-11-28 20:23:20,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:23:20,126 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2019-11-28 20:23:20,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:23:20,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-11-28 20:23:20,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:23:20,132 INFO L225 Difference]: With dead ends: 31 [2019-11-28 20:23:20,133 INFO L226 Difference]: Without dead ends: 30 [2019-11-28 20:23:20,134 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:23:20,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-28 20:23:20,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-11-28 20:23:20,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-28 20:23:20,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2019-11-28 20:23:20,148 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 6 [2019-11-28 20:23:20,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:23:20,149 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2019-11-28 20:23:20,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:23:20,149 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2019-11-28 20:23:20,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-28 20:23:20,150 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:23:20,150 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:23:20,150 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:23:20,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:23:20,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1537451600, now seen corresponding path program 1 times [2019-11-28 20:23:20,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:23:20,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125452072] [2019-11-28 20:23:20,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:23:20,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:23:20,182 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:23:20,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125452072] [2019-11-28 20:23:20,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:23:20,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 20:23:20,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585923134] [2019-11-28 20:23:20,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:23:20,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:23:20,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:23:20,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:23:20,185 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand 3 states. [2019-11-28 20:23:20,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:23:20,208 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2019-11-28 20:23:20,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:23:20,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-11-28 20:23:20,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:23:20,211 INFO L225 Difference]: With dead ends: 30 [2019-11-28 20:23:20,211 INFO L226 Difference]: Without dead ends: 29 [2019-11-28 20:23:20,211 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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:23:20,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-28 20:23:20,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-11-28 20:23:20,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-28 20:23:20,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2019-11-28 20:23:20,223 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 7 [2019-11-28 20:23:20,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:23:20,224 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2019-11-28 20:23:20,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:23:20,224 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2019-11-28 20:23:20,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-28 20:23:20,224 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:23:20,224 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:23:20,227 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:23:20,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:23:20,228 INFO L82 PathProgramCache]: Analyzing trace with hash -416359280, now seen corresponding path program 1 times [2019-11-28 20:23:20,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:23:20,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047880305] [2019-11-28 20:23:20,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:23:20,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:23:20,271 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:23:20,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047880305] [2019-11-28 20:23:20,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:23:20,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:23:20,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123517796] [2019-11-28 20:23:20,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:23:20,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:23:20,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:23:20,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:23:20,275 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand 3 states. [2019-11-28 20:23:20,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:23:20,297 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2019-11-28 20:23:20,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:23:20,299 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-11-28 20:23:20,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:23:20,300 INFO L225 Difference]: With dead ends: 29 [2019-11-28 20:23:20,300 INFO L226 Difference]: Without dead ends: 28 [2019-11-28 20:23:20,303 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:23:20,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-28 20:23:20,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-11-28 20:23:20,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-28 20:23:20,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2019-11-28 20:23:20,310 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 8 [2019-11-28 20:23:20,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:23:20,310 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2019-11-28 20:23:20,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:23:20,310 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2019-11-28 20:23:20,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 20:23:20,310 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:23:20,311 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2019-11-28 20:23:20,311 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:23:20,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:23:20,311 INFO L82 PathProgramCache]: Analyzing trace with hash -52819969, now seen corresponding path program 1 times [2019-11-28 20:23:20,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:23:20,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376955006] [2019-11-28 20:23:20,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:23:20,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:23:20,344 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:23:20,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376955006] [2019-11-28 20:23:20,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410136482] [2019-11-28 20:23:20,344 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:23:20,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:23:20,386 INFO L264 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 20:23:20,391 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:23:20,414 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:23:20,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:23:20,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-11-28 20:23:20,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701784905] [2019-11-28 20:23:20,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:23:20,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:23:20,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:23:20,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:23:20,417 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand 4 states. [2019-11-28 20:23:20,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:23:20,463 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2019-11-28 20:23:20,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:23:20,464 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-11-28 20:23:20,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:23:20,464 INFO L225 Difference]: With dead ends: 54 [2019-11-28 20:23:20,465 INFO L226 Difference]: Without dead ends: 53 [2019-11-28 20:23:20,465 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:23:20,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-28 20:23:20,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 32. [2019-11-28 20:23:20,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-28 20:23:20,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2019-11-28 20:23:20,473 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 9 [2019-11-28 20:23:20,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:23:20,473 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2019-11-28 20:23:20,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:23:20,473 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2019-11-28 20:23:20,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 20:23:20,474 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:23:20,474 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:23:20,683 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:23:20,684 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:23:20,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:23:20,684 INFO L82 PathProgramCache]: Analyzing trace with hash -689307342, now seen corresponding path program 1 times [2019-11-28 20:23:20,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:23:20,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934932581] [2019-11-28 20:23:20,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:23:20,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:23:20,730 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:23:20,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934932581] [2019-11-28 20:23:20,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:23:20,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:23:20,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070943201] [2019-11-28 20:23:20,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:23:20,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:23:20,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:23:20,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:23:20,736 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand 4 states. [2019-11-28 20:23:20,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:23:20,854 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2019-11-28 20:23:20,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:23:20,855 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-28 20:23:20,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:23:20,856 INFO L225 Difference]: With dead ends: 64 [2019-11-28 20:23:20,856 INFO L226 Difference]: Without dead ends: 62 [2019-11-28 20:23:20,857 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:23:20,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-28 20:23:20,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 42. [2019-11-28 20:23:20,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-28 20:23:20,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2019-11-28 20:23:20,865 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 10 [2019-11-28 20:23:20,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:23:20,866 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2019-11-28 20:23:20,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:23:20,866 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2019-11-28 20:23:20,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 20:23:20,867 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:23:20,867 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:23:20,868 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:23:20,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:23:20,868 INFO L82 PathProgramCache]: Analyzing trace with hash 106308951, now seen corresponding path program 1 times [2019-11-28 20:23:20,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:23:20,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263346434] [2019-11-28 20:23:20,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:23:20,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:23:20,900 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:23:20,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263346434] [2019-11-28 20:23:20,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:23:20,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:23:20,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651118091] [2019-11-28 20:23:20,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:23:20,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:23:20,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:23:20,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:23:20,904 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand 4 states. [2019-11-28 20:23:20,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:23:20,978 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2019-11-28 20:23:20,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:23:20,979 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 20:23:20,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:23:20,980 INFO L225 Difference]: With dead ends: 46 [2019-11-28 20:23:20,980 INFO L226 Difference]: Without dead ends: 44 [2019-11-28 20:23:20,981 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:23:20,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-28 20:23:20,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 35. [2019-11-28 20:23:20,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-28 20:23:20,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2019-11-28 20:23:20,988 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 11 [2019-11-28 20:23:20,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:23:20,988 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2019-11-28 20:23:20,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:23:20,989 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2019-11-28 20:23:20,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 20:23:20,989 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:23:20,990 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:23:20,990 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:23:20,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:23:20,991 INFO L82 PathProgramCache]: Analyzing trace with hash -999444228, now seen corresponding path program 1 times [2019-11-28 20:23:20,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:23:20,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986811318] [2019-11-28 20:23:20,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:23:21,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:23:21,027 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:23:21,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986811318] [2019-11-28 20:23:21,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85086252] [2019-11-28 20:23:21,029 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) [2019-11-28 20:23:21,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:23:21,067 INFO L264 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 20:23:21,070 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:23:21,073 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:23:21,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:23:21,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-11-28 20:23:21,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758843594] [2019-11-28 20:23:21,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:23:21,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:23:21,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:23:21,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:23:21,076 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand 4 states. [2019-11-28 20:23:21,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:23:21,124 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2019-11-28 20:23:21,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:23:21,126 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-28 20:23:21,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:23:21,127 INFO L225 Difference]: With dead ends: 66 [2019-11-28 20:23:21,127 INFO L226 Difference]: Without dead ends: 65 [2019-11-28 20:23:21,127 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:23:21,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-28 20:23:21,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 52. [2019-11-28 20:23:21,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-28 20:23:21,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 65 transitions. [2019-11-28 20:23:21,147 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 65 transitions. Word has length 12 [2019-11-28 20:23:21,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:23:21,148 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 65 transitions. [2019-11-28 20:23:21,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:23:21,148 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 65 transitions. [2019-11-28 20:23:21,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-28 20:23:21,149 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:23:21,150 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1] [2019-11-28 20:23:21,353 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:23:21,354 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:23:21,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:23:21,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1890502518, now seen corresponding path program 2 times [2019-11-28 20:23:21,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:23:21,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424178553] [2019-11-28 20:23:21,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:23:21,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:23:21,426 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:23:21,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424178553] [2019-11-28 20:23:21,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999814895] [2019-11-28 20:23:21,427 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 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:23:21,458 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-28 20:23:21,458 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:23:21,459 INFO L264 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:23:21,460 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:23:21,475 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-28 20:23:21,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:23:21,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 2] total 6 [2019-11-28 20:23:21,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178406662] [2019-11-28 20:23:21,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 20:23:21,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:23:21,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 20:23:21,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-28 20:23:21,479 INFO L87 Difference]: Start difference. First operand 52 states and 65 transitions. Second operand 8 states. [2019-11-28 20:23:21,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:23:21,641 INFO L93 Difference]: Finished difference Result 87 states and 104 transitions. [2019-11-28 20:23:21,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 20:23:21,642 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2019-11-28 20:23:21,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:23:21,644 INFO L225 Difference]: With dead ends: 87 [2019-11-28 20:23:21,645 INFO L226 Difference]: Without dead ends: 86 [2019-11-28 20:23:21,645 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-11-28 20:23:21,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-11-28 20:23:21,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 48. [2019-11-28 20:23:21,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-28 20:23:21,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2019-11-28 20:23:21,655 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 13 [2019-11-28 20:23:21,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:23:21,655 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2019-11-28 20:23:21,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 20:23:21,656 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2019-11-28 20:23:21,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 20:23:21,656 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:23:21,657 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:23:21,868 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:23:21,868 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:23:21,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:23:21,869 INFO L82 PathProgramCache]: Analyzing trace with hash -575852389, now seen corresponding path program 1 times [2019-11-28 20:23:21,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:23:21,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956905852] [2019-11-28 20:23:21,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:23:21,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:23:21,903 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 20:23:21,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956905852] [2019-11-28 20:23:21,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:23:21,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:23:21,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467016665] [2019-11-28 20:23:21,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:23:21,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:23:21,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:23:21,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:23:21,906 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. Second operand 4 states. [2019-11-28 20:23:21,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:23:21,943 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2019-11-28 20:23:21,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:23:21,943 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 20:23:21,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:23:21,944 INFO L225 Difference]: With dead ends: 48 [2019-11-28 20:23:21,944 INFO L226 Difference]: Without dead ends: 47 [2019-11-28 20:23:21,945 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:23:21,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-28 20:23:21,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2019-11-28 20:23:21,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-28 20:23:21,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2019-11-28 20:23:21,952 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 56 transitions. Word has length 14 [2019-11-28 20:23:21,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:23:21,953 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 56 transitions. [2019-11-28 20:23:21,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:23:21,953 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2019-11-28 20:23:21,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 20:23:21,956 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:23:21,956 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:23:21,956 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:23:21,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:23:21,957 INFO L82 PathProgramCache]: Analyzing trace with hash 656583171, now seen corresponding path program 1 times [2019-11-28 20:23:21,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:23:21,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284656958] [2019-11-28 20:23:21,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:23:21,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:23:22,048 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:23:22,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284656958] [2019-11-28 20:23:22,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643594971] [2019-11-28 20:23:22,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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:23:22,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:23:22,081 INFO L264 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:23:22,083 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:23:22,130 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:23:22,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:23:22,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 11 [2019-11-28 20:23:22,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933587157] [2019-11-28 20:23:22,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 20:23:22,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:23:22,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 20:23:22,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-28 20:23:22,133 INFO L87 Difference]: Start difference. First operand 45 states and 56 transitions. Second operand 11 states. [2019-11-28 20:23:22,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:23:22,563 INFO L93 Difference]: Finished difference Result 113 states and 134 transitions. [2019-11-28 20:23:22,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-28 20:23:22,563 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2019-11-28 20:23:22,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:23:22,564 INFO L225 Difference]: With dead ends: 113 [2019-11-28 20:23:22,564 INFO L226 Difference]: Without dead ends: 67 [2019-11-28 20:23:22,565 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2019-11-28 20:23:22,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-28 20:23:22,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 45. [2019-11-28 20:23:22,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-28 20:23:22,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2019-11-28 20:23:22,572 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 16 [2019-11-28 20:23:22,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:23:22,573 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2019-11-28 20:23:22,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 20:23:22,573 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2019-11-28 20:23:22,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 20:23:22,576 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:23:22,576 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:23:22,779 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:23:22,781 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:23:22,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:23:22,782 INFO L82 PathProgramCache]: Analyzing trace with hash 471235363, now seen corresponding path program 1 times [2019-11-28 20:23:22,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:23:22,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448170166] [2019-11-28 20:23:22,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:23:22,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:23:22,827 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:23:22,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448170166] [2019-11-28 20:23:22,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937488876] [2019-11-28 20:23:22,828 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:23:22,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:23:22,869 INFO L264 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 20:23:22,870 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:23:22,874 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:23:22,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:23:22,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-11-28 20:23:22,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97936284] [2019-11-28 20:23:22,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 20:23:22,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:23:22,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:23:22,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:23:22,877 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. Second operand 6 states. [2019-11-28 20:23:22,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:23:22,988 INFO L93 Difference]: Finished difference Result 116 states and 134 transitions. [2019-11-28 20:23:22,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 20:23:22,989 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-11-28 20:23:22,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:23:22,990 INFO L225 Difference]: With dead ends: 116 [2019-11-28 20:23:22,990 INFO L226 Difference]: Without dead ends: 115 [2019-11-28 20:23:22,991 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-11-28 20:23:22,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-28 20:23:22,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 68. [2019-11-28 20:23:23,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-28 20:23:23,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 82 transitions. [2019-11-28 20:23:23,001 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 82 transitions. Word has length 17 [2019-11-28 20:23:23,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:23:23,001 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 82 transitions. [2019-11-28 20:23:23,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 20:23:23,001 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 82 transitions. [2019-11-28 20:23:23,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 20:23:23,002 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:23:23,003 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-11-28 20:23:23,206 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:23:23,207 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:23:23,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:23:23,208 INFO L82 PathProgramCache]: Analyzing trace with hash -415013654, now seen corresponding path program 2 times [2019-11-28 20:23:23,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:23:23,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500685249] [2019-11-28 20:23:23,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:23:23,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:23:23,274 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:23:23,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500685249] [2019-11-28 20:23:23,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738851742] [2019-11-28 20:23:23,275 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 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:23:23,310 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-28 20:23:23,310 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:23:23,311 INFO L264 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:23:23,312 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:23:23,334 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-28 20:23:23,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:23:23,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 2] total 6 [2019-11-28 20:23:23,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757768666] [2019-11-28 20:23:23,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 20:23:23,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:23:23,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 20:23:23,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:23:23,338 INFO L87 Difference]: Start difference. First operand 68 states and 82 transitions. Second operand 7 states. [2019-11-28 20:23:23,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:23:23,427 INFO L93 Difference]: Finished difference Result 139 states and 168 transitions. [2019-11-28 20:23:23,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 20:23:23,428 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-11-28 20:23:23,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:23:23,430 INFO L225 Difference]: With dead ends: 139 [2019-11-28 20:23:23,430 INFO L226 Difference]: Without dead ends: 138 [2019-11-28 20:23:23,431 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-11-28 20:23:23,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-11-28 20:23:23,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 39. [2019-11-28 20:23:23,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-28 20:23:23,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2019-11-28 20:23:23,439 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 19 [2019-11-28 20:23:23,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:23:23,439 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2019-11-28 20:23:23,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 20:23:23,440 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2019-11-28 20:23:23,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 20:23:23,441 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:23:23,441 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:23:23,649 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:23:23,649 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:23:23,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:23:23,650 INFO L82 PathProgramCache]: Analyzing trace with hash 2095953530, now seen corresponding path program 2 times [2019-11-28 20:23:23,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:23:23,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976592915] [2019-11-28 20:23:23,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:23:23,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:23:23,740 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:23:23,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976592915] [2019-11-28 20:23:23,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637585835] [2019-11-28 20:23:23,741 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 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:23:23,782 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 20:23:23,783 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:23:23,783 INFO L264 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 20:23:23,787 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:23:23,795 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:23:23,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:23:23,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-11-28 20:23:23,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862147621] [2019-11-28 20:23:23,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 20:23:23,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:23:23,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 20:23:23,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:23:23,801 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand 7 states. [2019-11-28 20:23:23,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:23:23,929 INFO L93 Difference]: Finished difference Result 92 states and 105 transitions. [2019-11-28 20:23:23,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 20:23:23,930 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-11-28 20:23:23,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:23:23,931 INFO L225 Difference]: With dead ends: 92 [2019-11-28 20:23:23,931 INFO L226 Difference]: Without dead ends: 91 [2019-11-28 20:23:23,932 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-11-28 20:23:23,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-28 20:23:23,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 44. [2019-11-28 20:23:23,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-28 20:23:23,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2019-11-28 20:23:23,944 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 22 [2019-11-28 20:23:23,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:23:23,945 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2019-11-28 20:23:23,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 20:23:23,945 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2019-11-28 20:23:23,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 20:23:23,946 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:23:23,946 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:23:24,149 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:23:24,152 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:23:24,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:23:24,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1289288067, now seen corresponding path program 3 times [2019-11-28 20:23:24,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:23:24,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477546293] [2019-11-28 20:23:24,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:23:24,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:23:24,225 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:23:24,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477546293] [2019-11-28 20:23:24,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487696721] [2019-11-28 20:23:24,226 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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:23:24,260 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-28 20:23:24,260 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:23:24,261 INFO L264 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 20:23:24,262 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:23:24,322 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-28 20:23:24,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:23:24,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 11 [2019-11-28 20:23:24,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892653262] [2019-11-28 20:23:24,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 20:23:24,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:23:24,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 20:23:24,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-11-28 20:23:24,325 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand 12 states. [2019-11-28 20:23:24,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:23:24,789 INFO L93 Difference]: Finished difference Result 143 states and 166 transitions. [2019-11-28 20:23:24,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-28 20:23:24,790 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2019-11-28 20:23:24,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:23:24,791 INFO L225 Difference]: With dead ends: 143 [2019-11-28 20:23:24,791 INFO L226 Difference]: Without dead ends: 142 [2019-11-28 20:23:24,792 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=358, Invalid=698, Unknown=0, NotChecked=0, Total=1056 [2019-11-28 20:23:24,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-11-28 20:23:24,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 60. [2019-11-28 20:23:24,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-28 20:23:24,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 70 transitions. [2019-11-28 20:23:24,800 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 70 transitions. Word has length 27 [2019-11-28 20:23:24,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:23:24,800 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 70 transitions. [2019-11-28 20:23:24,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 20:23:24,800 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2019-11-28 20:23:24,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-28 20:23:24,801 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:23:24,801 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-28 20:23:25,004 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:23:25,005 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:23:25,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:23:25,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1685598945, now seen corresponding path program 1 times [2019-11-28 20:23:25,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:23:25,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578305933] [2019-11-28 20:23:25,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:23:25,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:23:25,124 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 13 proven. 35 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 20:23:25,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578305933] [2019-11-28 20:23:25,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072797054] [2019-11-28 20:23:25,125 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:23:25,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:23:25,160 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 20:23:25,162 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:23:25,240 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-28 20:23:25,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 20:23:25,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 17 [2019-11-28 20:23:25,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490057016] [2019-11-28 20:23:25,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 20:23:25,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:23:25,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:23:25,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2019-11-28 20:23:25,243 INFO L87 Difference]: Start difference. First operand 60 states and 70 transitions. Second operand 6 states. [2019-11-28 20:23:25,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:23:25,350 INFO L93 Difference]: Finished difference Result 147 states and 172 transitions. [2019-11-28 20:23:25,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 20:23:25,351 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-11-28 20:23:25,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:23:25,352 INFO L225 Difference]: With dead ends: 147 [2019-11-28 20:23:25,352 INFO L226 Difference]: Without dead ends: 102 [2019-11-28 20:23:25,353 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2019-11-28 20:23:25,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-11-28 20:23:25,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 71. [2019-11-28 20:23:25,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-28 20:23:25,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2019-11-28 20:23:25,366 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 39 [2019-11-28 20:23:25,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:23:25,367 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2019-11-28 20:23:25,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 20:23:25,367 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2019-11-28 20:23:25,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-28 20:23:25,371 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:23:25,372 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-28 20:23:25,584 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:23:25,585 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:23:25,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:23:25,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1243466243, now seen corresponding path program 2 times [2019-11-28 20:23:25,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:23:25,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326813924] [2019-11-28 20:23:25,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:23:25,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:23:25,700 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 20:23:25,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326813924] [2019-11-28 20:23:25,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301615596] [2019-11-28 20:23:25,701 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:23:25,750 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 20:23:25,750 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:23:25,751 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 20:23:25,753 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:23:25,769 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 20:23:25,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:23:25,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-11-28 20:23:25,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103124643] [2019-11-28 20:23:25,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 20:23:25,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:23:25,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 20:23:25,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-28 20:23:25,775 INFO L87 Difference]: Start difference. First operand 71 states and 80 transitions. Second operand 10 states. [2019-11-28 20:23:25,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:23:25,985 INFO L93 Difference]: Finished difference Result 142 states and 156 transitions. [2019-11-28 20:23:25,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 20:23:25,985 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2019-11-28 20:23:25,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:23:25,986 INFO L225 Difference]: With dead ends: 142 [2019-11-28 20:23:25,986 INFO L226 Difference]: Without dead ends: 141 [2019-11-28 20:23:25,987 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=138, Invalid=242, Unknown=0, NotChecked=0, Total=380 [2019-11-28 20:23:25,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-11-28 20:23:25,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 82. [2019-11-28 20:23:25,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-11-28 20:23:25,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2019-11-28 20:23:25,999 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 39 [2019-11-28 20:23:25,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:23:25,999 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2019-11-28 20:23:25,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 20:23:26,000 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2019-11-28 20:23:26,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-28 20:23:26,000 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:23:26,000 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-11-28 20:23:26,204 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:23:26,205 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:23:26,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:23:26,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1165798321, now seen corresponding path program 3 times [2019-11-28 20:23:26,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:23:26,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523035048] [2019-11-28 20:23:26,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:23:26,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:23:26,299 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 20:23:26,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523035048] [2019-11-28 20:23:26,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907801104] [2019-11-28 20:23:26,300 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:23:26,344 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-28 20:23:26,344 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:23:26,345 INFO L264 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 20:23:26,348 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:23:26,409 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-11-28 20:23:26,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:23:26,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 3] total 13 [2019-11-28 20:23:26,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620620452] [2019-11-28 20:23:26,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-28 20:23:26,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:23:26,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 20:23:26,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-11-28 20:23:26,413 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand 14 states. [2019-11-28 20:23:26,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:23:26,939 INFO L93 Difference]: Finished difference Result 198 states and 220 transitions. [2019-11-28 20:23:26,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-28 20:23:26,940 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 43 [2019-11-28 20:23:26,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:23:26,940 INFO L225 Difference]: With dead ends: 198 [2019-11-28 20:23:26,940 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 20:23:26,942 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=430, Invalid=830, Unknown=0, NotChecked=0, Total=1260 [2019-11-28 20:23:26,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 20:23:26,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 20:23:26,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 20:23:26,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 20:23:26,944 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43 [2019-11-28 20:23:26,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:23:26,944 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:23:26,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-28 20:23:26,945 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 20:23:26,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 20:23:27,149 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:23:27,152 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 20:23:27,404 WARN L192 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 108 [2019-11-28 20:23:27,860 WARN L192 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 142 [2019-11-28 20:23:28,277 WARN L192 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 140 [2019-11-28 20:23:28,723 WARN L192 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 30 [2019-11-28 20:23:29,540 WARN L192 SmtUtils]: Spent 813.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 38 [2019-11-28 20:23:30,139 WARN L192 SmtUtils]: Spent 597.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 30 [2019-11-28 20:23:30,143 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) no Hoare annotation was computed. [2019-11-28 20:23:30,143 INFO L242 CegarLoopResult]: At program point L23-2(lines 23 34) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_main_~n~0 2147483647)) (.cse3 (<= 0 ULTIMATE.start_main_~j~0)) (.cse1 (<= ULTIMATE.start_main_~m~0 2147483647)) (.cse2 (<= 0 ULTIMATE.start_main_~N~0)) (.cse4 (<= ULTIMATE.start_main_~N~0 2147483647)) (.cse5 (<= 0 ULTIMATE.start_main_~i~0))) (or (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_main_~N~0 ULTIMATE.start_main_~i~0) (<= ULTIMATE.start_main_~N~0 (+ ULTIMATE.start_main_~k~0 1)) .cse3 .cse4 .cse5) (and .cse0 (<= ULTIMATE.start_main_~m~0 0) .cse2 (<= ULTIMATE.start_main_~j~0 0) .cse3 .cse4 .cse5) (and (<= ULTIMATE.start_main_~i~0 0) .cse1 .cse2 (<= (+ ULTIMATE.start_main_~n~0 ULTIMATE.start_main_~i~0) 2147483647) .cse4 .cse5))) [2019-11-28 20:23:30,143 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 33) no Hoare annotation was computed. [2019-11-28 20:23:30,144 INFO L249 CegarLoopResult]: At program point L36(lines 13 37) the Hoare annotation is: true [2019-11-28 20:23:30,144 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2019-11-28 20:23:30,144 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 20:23:30,144 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2019-11-28 20:23:30,144 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 20:23:30,144 INFO L246 CegarLoopResult]: For program point L28-1(line 28) no Hoare annotation was computed. [2019-11-28 20:23:30,144 INFO L246 CegarLoopResult]: For program point L28-2(lines 28 30) no Hoare annotation was computed. [2019-11-28 20:23:30,144 INFO L242 CegarLoopResult]: At program point L28-4(lines 28 30) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_main_~n~0 2147483647)) (.cse1 (<= ULTIMATE.start_main_~m~0 2147483647)) (.cse2 (<= 0 ULTIMATE.start_main_~k~0)) (.cse3 (<= 0 ULTIMATE.start_main_~N~0)) (.cse4 (<= 0 ULTIMATE.start_main_~j~0)) (.cse5 (<= ULTIMATE.start_main_~k~0 2147483646)) (.cse6 (<= ULTIMATE.start_main_~N~0 2147483647)) (.cse7 (<= 0 ULTIMATE.start_main_~i~0))) (or (and (<= ULTIMATE.start_main_~i~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_main_~N~0 (+ ULTIMATE.start_main_~i~0 1)) (<= ULTIMATE.start_main_~N~0 (+ ULTIMATE.start_main_~k~0 1)) .cse4 .cse5 .cse6 .cse7))) [2019-11-28 20:23:30,145 INFO L246 CegarLoopResult]: For program point L28-5(lines 28 30) no Hoare annotation was computed. [2019-11-28 20:23:30,145 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2019-11-28 20:23:30,145 INFO L246 CegarLoopResult]: For program point L33(line 33) no Hoare annotation was computed. [2019-11-28 20:23:30,145 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 20:23:30,145 INFO L246 CegarLoopResult]: For program point L29(line 29) no Hoare annotation was computed. [2019-11-28 20:23:30,145 INFO L246 CegarLoopResult]: For program point L29-1(line 29) no Hoare annotation was computed. [2019-11-28 20:23:30,145 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2019-11-28 20:23:30,146 INFO L242 CegarLoopResult]: At program point L25-2(lines 25 32) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_main_~m~0 2147483647)) (.cse7 (<= ULTIMATE.start_main_~N~0 (+ ULTIMATE.start_main_~k~0 1))) (.cse6 (<= ULTIMATE.start_main_~n~0 2147483647)) (.cse1 (<= 0 ULTIMATE.start_main_~N~0)) (.cse2 (<= ULTIMATE.start_main_~j~0 0)) (.cse3 (<= 0 ULTIMATE.start_main_~j~0)) (.cse8 (<= ULTIMATE.start_main_~i~0 2147483646)) (.cse4 (<= ULTIMATE.start_main_~N~0 2147483647)) (.cse5 (<= 0 ULTIMATE.start_main_~i~0))) (or (and (<= ULTIMATE.start_main_~i~0 0) .cse0 .cse1 .cse2 (<= (+ ULTIMATE.start_main_~n~0 ULTIMATE.start_main_~i~0) 2147483647) .cse3 .cse4 .cse5) (and .cse6 (<= 0 ULTIMATE.start_main_~k~0) .cse0 .cse1 (<= ULTIMATE.start_main_~N~0 (+ ULTIMATE.start_main_~i~0 1)) .cse7 .cse3 (<= ULTIMATE.start_main_~k~0 2147483646) .cse8 .cse5) (and .cse6 .cse0 .cse1 .cse2 (<= ULTIMATE.start_main_~N~0 ULTIMATE.start_main_~i~0) .cse7 .cse3 .cse8 .cse4 .cse5) (and .cse6 (<= ULTIMATE.start_main_~m~0 0) .cse1 .cse2 .cse3 .cse8 .cse4 .cse5))) [2019-11-28 20:23:30,146 INFO L246 CegarLoopResult]: For program point L25-3(lines 25 32) no Hoare annotation was computed. [2019-11-28 20:23:30,146 INFO L246 CegarLoopResult]: For program point L21(lines 21 35) no Hoare annotation was computed. [2019-11-28 20:23:30,146 INFO L246 CegarLoopResult]: For program point L21-1(lines 21 35) no Hoare annotation was computed. [2019-11-28 20:23:30,146 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) no Hoare annotation was computed. [2019-11-28 20:23:30,146 INFO L246 CegarLoopResult]: For program point L26(line 26) no Hoare annotation was computed. [2019-11-28 20:23:30,146 INFO L246 CegarLoopResult]: For program point L26-1(line 26) no Hoare annotation was computed. [2019-11-28 20:23:30,146 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 33) no Hoare annotation was computed. [2019-11-28 20:23:30,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:23:30 BoogieIcfgContainer [2019-11-28 20:23:30,179 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 20:23:30,180 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:23:30,180 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:23:30,181 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:23:30,182 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:23:19" (3/4) ... [2019-11-28 20:23:30,194 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 20:23:30,211 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-28 20:23:30,212 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 20:23:30,274 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 20:23:30,275 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:23:30,276 INFO L168 Benchmark]: Toolchain (without parser) took 11539.37 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 308.8 MB). Free memory was 956.3 MB in the beginning and 1.3 GB in the end (delta: -338.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:23:30,277 INFO L168 Benchmark]: CDTParser took 0.29 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:23:30,277 INFO L168 Benchmark]: CACSL2BoogieTranslator took 249.51 ms. Allocated memory is still 1.0 GB. Free memory was 956.3 MB in the beginning and 945.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:23:30,277 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.32 ms. Allocated memory is still 1.0 GB. Free memory is still 945.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:23:30,278 INFO L168 Benchmark]: Boogie Preprocessor took 84.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -181.5 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:23:30,279 INFO L168 Benchmark]: RCFGBuilder took 273.29 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: 12.8 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. [2019-11-28 20:23:30,279 INFO L168 Benchmark]: TraceAbstraction took 10791.89 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 171.4 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -180.4 MB). Peak memory consumption was 446.9 MB. Max. memory is 11.5 GB. [2019-11-28 20:23:30,279 INFO L168 Benchmark]: Witness Printer took 94.66 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:23:30,282 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.29 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 249.51 ms. Allocated memory is still 1.0 GB. Free memory was 956.3 MB in the beginning and 945.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.32 ms. Allocated memory is still 1.0 GB. Free memory is still 945.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 84.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -181.5 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 273.29 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: 12.8 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10791.89 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 171.4 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -180.4 MB). Peak memory consumption was 446.9 MB. Max. memory is 11.5 GB. * Witness Printer took 94.66 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: ((((((((n <= 2147483647 && m <= 2147483647) && 0 <= N) && N <= i) && N <= k + 1) && 0 <= j) && N <= 2147483647) && 0 <= i) || ((((((n <= 2147483647 && m <= 0) && 0 <= N) && j <= 0) && 0 <= j) && N <= 2147483647) && 0 <= i)) || (((((i <= 0 && m <= 2147483647) && 0 <= N) && n + i <= 2147483647) && N <= 2147483647) && 0 <= i) - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: (((((((((i <= 0 && m <= 2147483647) && 0 <= N) && j <= 0) && n + i <= 2147483647) && 0 <= j) && N <= 2147483647) && 0 <= i) || (((((((((n <= 2147483647 && 0 <= k) && m <= 2147483647) && 0 <= N) && N <= i + 1) && N <= k + 1) && 0 <= j) && k <= 2147483646) && i <= 2147483646) && 0 <= i)) || (((((((((n <= 2147483647 && m <= 2147483647) && 0 <= N) && j <= 0) && N <= i) && N <= k + 1) && 0 <= j) && i <= 2147483646) && N <= 2147483647) && 0 <= i)) || (((((((n <= 2147483647 && m <= 0) && 0 <= N) && j <= 0) && 0 <= j) && i <= 2147483646) && N <= 2147483647) && 0 <= i) - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: ((((((((i <= 0 && n <= 2147483647) && m <= 2147483647) && 0 <= k) && 0 <= N) && 0 <= j) && k <= 2147483646) && N <= 2147483647) && 0 <= i) || (((((((((n <= 2147483647 && m <= 2147483647) && 0 <= k) && 0 <= N) && N <= i + 1) && N <= k + 1) && 0 <= j) && k <= 2147483646) && N <= 2147483647) && 0 <= i) - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 26 locations, 8 error locations. Result: SAFE, OverallTime: 7.6s, OverallIterations: 21, TraceHistogramMax: 6, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.9s, HoareTripleCheckerStatistics: 321 SDtfs, 1164 SDslu, 557 SDs, 0 SdLazy, 985 SolverSat, 288 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 437 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 767 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 21 MinimizatonAttempts, 524 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 68 NumberOfFragments, 257 HoareAnnotationTreeSize, 4 FomulaSimplifications, 4319131 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 4 FomulaSimplificationsInter, 1386672 FormulaSimplificationTreeSizeReductionInter, 1.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 589 NumberOfCodeBlocks, 530 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 557 ConstructedInterpolants, 0 QuantifiedInterpolants, 43409 SizeOfPredicates, 24 NumberOfNonLiveVariables, 638 ConjunctsInSsa, 57 ConjunctsInUnsatCore, 32 InterpolantComputations, 11 PerfectInterpolantSequences, 145/478 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 proved your program to be correct! Received shutdown request...