./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted/NestedRecursion_1d.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/NestedRecursion_1d.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 0837a1e1d82be1b28ccf3514392f1b01c88a9160 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:22:38,724 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:22:38,726 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:22:38,739 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:22:38,740 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:22:38,741 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:22:38,743 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:22:38,745 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:22:38,747 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:22:38,748 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:22:38,749 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:22:38,751 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:22:38,751 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:22:38,752 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:22:38,753 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:22:38,754 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:22:38,756 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:22:38,757 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:22:38,759 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:22:38,761 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:22:38,763 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:22:38,764 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:22:38,768 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:22:38,769 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:22:38,772 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:22:38,774 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:22:38,774 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:22:38,775 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:22:38,776 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:22:38,777 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:22:38,779 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:22:38,780 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:22:38,781 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:22:38,781 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:22:38,783 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:22:38,786 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:22:38,787 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:22:38,788 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:22:38,788 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:22:38,789 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:22:38,793 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:22:38,795 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:22:38,819 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:22:38,819 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:22:38,823 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:22:38,824 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:22:38,824 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:22:38,825 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:22:38,825 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:22:38,825 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:22:38,826 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:22:38,826 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 20:22:38,827 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 20:22:38,827 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 20:22:38,827 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-11-28 20:22:38,827 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 20:22:38,828 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:22:38,828 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 20:22:38,828 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:22:38,828 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:22:38,828 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 20:22:38,829 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 20:22:38,829 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 20:22:38,829 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:22:38,829 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 20:22:38,830 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 20:22:38,830 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:22:38,830 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 20:22:38,830 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 20:22:38,830 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:22:38,831 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 -> 0837a1e1d82be1b28ccf3514392f1b01c88a9160 [2019-11-28 20:22:39,157 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:22:39,176 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:22:39,181 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:22:39,183 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:22:39,184 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:22:39,184 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/NestedRecursion_1d.c [2019-11-28 20:22:39,255 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bf985e59/7792486b4abe4253949a7fd1178fb248/FLAGce0980d7b [2019-11-28 20:22:39,727 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:22:39,727 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/NestedRecursion_1d.c [2019-11-28 20:22:39,734 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bf985e59/7792486b4abe4253949a7fd1178fb248/FLAGce0980d7b [2019-11-28 20:22:40,079 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bf985e59/7792486b4abe4253949a7fd1178fb248 [2019-11-28 20:22:40,082 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:22:40,084 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 20:22:40,085 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:22:40,085 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:22:40,089 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:22:40,090 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:22:40" (1/1) ... [2019-11-28 20:22:40,093 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@245e5474 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:40, skipping insertion in model container [2019-11-28 20:22:40,093 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:22:40" (1/1) ... [2019-11-28 20:22:40,100 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:22:40,118 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:22:40,282 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:22:40,286 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:22:40,301 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:22:40,315 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:22:40,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:40 WrapperNode [2019-11-28 20:22:40,316 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:22:40,317 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 20:22:40,317 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 20:22:40,318 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 20:22:40,324 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:22:40" (1/1) ... [2019-11-28 20:22:40,328 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:22:40" (1/1) ... [2019-11-28 20:22:40,344 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 20:22:40,345 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:22:40,345 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:22:40,345 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:22:40,411 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:40" (1/1) ... [2019-11-28 20:22:40,411 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:40" (1/1) ... [2019-11-28 20:22:40,412 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:40" (1/1) ... [2019-11-28 20:22:40,412 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:40" (1/1) ... [2019-11-28 20:22:40,415 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:40" (1/1) ... [2019-11-28 20:22:40,417 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:40" (1/1) ... [2019-11-28 20:22:40,418 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:40" (1/1) ... [2019-11-28 20:22:40,420 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:22:40,420 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:22:40,420 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:22:40,421 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:22:40,421 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:40" (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:22:40,480 INFO L130 BoogieDeclarations]: Found specification of procedure rec1 [2019-11-28 20:22:40,480 INFO L138 BoogieDeclarations]: Found implementation of procedure rec1 [2019-11-28 20:22:40,480 INFO L130 BoogieDeclarations]: Found specification of procedure rec2 [2019-11-28 20:22:40,481 INFO L138 BoogieDeclarations]: Found implementation of procedure rec2 [2019-11-28 20:22:40,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:22:40,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:22:40,741 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:22:40,742 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-28 20:22:40,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:22:40 BoogieIcfgContainer [2019-11-28 20:22:40,743 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:22:40,744 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 20:22:40,744 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 20:22:40,747 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 20:22:40,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:22:40" (1/3) ... [2019-11-28 20:22:40,759 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54885b99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:22:40, skipping insertion in model container [2019-11-28 20:22:40,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:40" (2/3) ... [2019-11-28 20:22:40,760 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54885b99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:22:40, skipping insertion in model container [2019-11-28 20:22:40,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:22:40" (3/3) ... [2019-11-28 20:22:40,765 INFO L109 eAbstractionObserver]: Analyzing ICFG NestedRecursion_1d.c [2019-11-28 20:22:40,776 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 20:22:40,784 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2019-11-28 20:22:40,794 INFO L249 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2019-11-28 20:22:40,819 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 20:22:40,819 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 20:22:40,820 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 20:22:40,820 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:22:40,820 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:22:40,820 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 20:22:40,820 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:22:40,820 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 20:22:40,841 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2019-11-28 20:22:40,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-28 20:22:40,846 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:40,847 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:22:40,847 INFO L410 AbstractCegarLoop]: === Iteration 1 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:40,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:40,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1656652383, now seen corresponding path program 1 times [2019-11-28 20:22:40,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:40,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090341618] [2019-11-28 20:22:40,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:40,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:41,067 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:22:41,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090341618] [2019-11-28 20:22:41,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:22:41,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 20:22:41,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731357131] [2019-11-28 20:22:41,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 20:22:41,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:41,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 20:22:41,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:22:41,091 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 7 states. [2019-11-28 20:22:41,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:41,359 INFO L93 Difference]: Finished difference Result 86 states and 102 transitions. [2019-11-28 20:22:41,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 20:22:41,361 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2019-11-28 20:22:41,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:41,374 INFO L225 Difference]: With dead ends: 86 [2019-11-28 20:22:41,374 INFO L226 Difference]: Without dead ends: 79 [2019-11-28 20:22:41,378 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:22:41,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-11-28 20:22:41,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 66. [2019-11-28 20:22:41,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-28 20:22:41,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 84 transitions. [2019-11-28 20:22:41,438 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 84 transitions. Word has length 8 [2019-11-28 20:22:41,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:41,439 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 84 transitions. [2019-11-28 20:22:41,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 20:22:41,439 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2019-11-28 20:22:41,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 20:22:41,441 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:41,441 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:22:41,442 INFO L410 AbstractCegarLoop]: === Iteration 2 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:41,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:41,442 INFO L82 PathProgramCache]: Analyzing trace with hash -183383641, now seen corresponding path program 1 times [2019-11-28 20:22:41,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:41,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031826516] [2019-11-28 20:22:41,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:41,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:41,467 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:22:41,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031826516] [2019-11-28 20:22:41,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:22:41,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:22:41,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163627643] [2019-11-28 20:22:41,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:22:41,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:41,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:22:41,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:22:41,471 INFO L87 Difference]: Start difference. First operand 66 states and 84 transitions. Second operand 3 states. [2019-11-28 20:22:41,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:41,514 INFO L93 Difference]: Finished difference Result 70 states and 94 transitions. [2019-11-28 20:22:41,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:22:41,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-28 20:22:41,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:41,521 INFO L225 Difference]: With dead ends: 70 [2019-11-28 20:22:41,521 INFO L226 Difference]: Without dead ends: 69 [2019-11-28 20:22:41,526 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:22:41,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-28 20:22:41,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2019-11-28 20:22:41,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-28 20:22:41,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 82 transitions. [2019-11-28 20:22:41,559 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 82 transitions. Word has length 9 [2019-11-28 20:22:41,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:41,559 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 82 transitions. [2019-11-28 20:22:41,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:22:41,563 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 82 transitions. [2019-11-28 20:22:41,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 20:22:41,563 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:41,564 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:22:41,564 INFO L410 AbstractCegarLoop]: === Iteration 3 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:41,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:41,565 INFO L82 PathProgramCache]: Analyzing trace with hash -138388889, now seen corresponding path program 1 times [2019-11-28 20:22:41,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:41,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942855760] [2019-11-28 20:22:41,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:41,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:41,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:41,613 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:22:41,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942855760] [2019-11-28 20:22:41,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:22:41,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:22:41,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141337446] [2019-11-28 20:22:41,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:22:41,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:41,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:22:41,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:22:41,620 INFO L87 Difference]: Start difference. First operand 65 states and 82 transitions. Second operand 3 states. [2019-11-28 20:22:41,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:41,641 INFO L93 Difference]: Finished difference Result 65 states and 82 transitions. [2019-11-28 20:22:41,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:22:41,642 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-28 20:22:41,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:41,644 INFO L225 Difference]: With dead ends: 65 [2019-11-28 20:22:41,644 INFO L226 Difference]: Without dead ends: 64 [2019-11-28 20:22:41,646 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:22:41,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-28 20:22:41,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-11-28 20:22:41,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-28 20:22:41,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 80 transitions. [2019-11-28 20:22:41,663 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 80 transitions. Word has length 11 [2019-11-28 20:22:41,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:41,663 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 80 transitions. [2019-11-28 20:22:41,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:22:41,668 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 80 transitions. [2019-11-28 20:22:41,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 20:22:41,669 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:41,669 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:22:41,669 INFO L410 AbstractCegarLoop]: === Iteration 4 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:41,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:41,670 INFO L82 PathProgramCache]: Analyzing trace with hash 4911801, now seen corresponding path program 1 times [2019-11-28 20:22:41,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:41,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595888479] [2019-11-28 20:22:41,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:41,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:41,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:41,739 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:22:41,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595888479] [2019-11-28 20:22:41,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:22:41,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:22:41,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785823606] [2019-11-28 20:22:41,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:22:41,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:41,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:22:41,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:22:41,742 INFO L87 Difference]: Start difference. First operand 64 states and 80 transitions. Second operand 4 states. [2019-11-28 20:22:41,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:41,773 INFO L93 Difference]: Finished difference Result 85 states and 111 transitions. [2019-11-28 20:22:41,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:22:41,775 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-28 20:22:41,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:41,776 INFO L225 Difference]: With dead ends: 85 [2019-11-28 20:22:41,776 INFO L226 Difference]: Without dead ends: 84 [2019-11-28 20:22:41,777 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:22:41,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-11-28 20:22:41,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 74. [2019-11-28 20:22:41,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-28 20:22:41,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 96 transitions. [2019-11-28 20:22:41,792 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 96 transitions. Word has length 12 [2019-11-28 20:22:41,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:41,793 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 96 transitions. [2019-11-28 20:22:41,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:22:41,793 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 96 transitions. [2019-11-28 20:22:41,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 20:22:41,794 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:41,794 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:22:41,794 INFO L410 AbstractCegarLoop]: === Iteration 5 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:41,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:41,795 INFO L82 PathProgramCache]: Analyzing trace with hash 2115393736, now seen corresponding path program 1 times [2019-11-28 20:22:41,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:41,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109589175] [2019-11-28 20:22:41,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:41,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:41,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:41,829 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:22:41,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109589175] [2019-11-28 20:22:41,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:22:41,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:22:41,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543345743] [2019-11-28 20:22:41,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:22:41,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:41,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:22:41,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:22:41,835 INFO L87 Difference]: Start difference. First operand 74 states and 96 transitions. Second operand 3 states. [2019-11-28 20:22:41,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:41,856 INFO L93 Difference]: Finished difference Result 74 states and 96 transitions. [2019-11-28 20:22:41,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:22:41,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 20:22:41,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:41,862 INFO L225 Difference]: With dead ends: 74 [2019-11-28 20:22:41,862 INFO L226 Difference]: Without dead ends: 73 [2019-11-28 20:22:41,863 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:22:41,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-28 20:22:41,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-11-28 20:22:41,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-28 20:22:41,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 94 transitions. [2019-11-28 20:22:41,879 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 94 transitions. Word has length 16 [2019-11-28 20:22:41,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:41,879 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 94 transitions. [2019-11-28 20:22:41,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:22:41,880 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 94 transitions. [2019-11-28 20:22:41,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 20:22:41,882 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:41,882 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:22:41,883 INFO L410 AbstractCegarLoop]: === Iteration 6 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:41,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:41,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1152696420, now seen corresponding path program 1 times [2019-11-28 20:22:41,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:41,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345613593] [2019-11-28 20:22:41,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:41,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:41,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:41,932 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:22:41,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345613593] [2019-11-28 20:22:41,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:22:41,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:22:41,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771208925] [2019-11-28 20:22:41,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:22:41,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:41,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:22:41,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:22:41,936 INFO L87 Difference]: Start difference. First operand 73 states and 94 transitions. Second operand 4 states. [2019-11-28 20:22:41,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:41,981 INFO L93 Difference]: Finished difference Result 94 states and 126 transitions. [2019-11-28 20:22:41,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:22:41,983 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-28 20:22:41,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:41,984 INFO L225 Difference]: With dead ends: 94 [2019-11-28 20:22:41,985 INFO L226 Difference]: Without dead ends: 93 [2019-11-28 20:22:41,986 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:22:41,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-11-28 20:22:42,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 79. [2019-11-28 20:22:42,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-28 20:22:42,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 100 transitions. [2019-11-28 20:22:42,012 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 100 transitions. Word has length 17 [2019-11-28 20:22:42,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:42,012 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 100 transitions. [2019-11-28 20:22:42,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:22:42,012 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 100 transitions. [2019-11-28 20:22:42,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 20:22:42,013 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:42,014 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:22:42,016 INFO L410 AbstractCegarLoop]: === Iteration 7 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:42,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:42,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1079409517, now seen corresponding path program 1 times [2019-11-28 20:22:42,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:42,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866526992] [2019-11-28 20:22:42,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:42,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:42,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:42,157 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:22:42,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866526992] [2019-11-28 20:22:42,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660362673] [2019-11-28 20:22:42,159 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:22:42,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:42,197 INFO L264 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:22:42,204 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:22:42,257 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:22:42,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 20:22:42,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 11 [2019-11-28 20:22:42,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178845322] [2019-11-28 20:22:42,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 20:22:42,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:42,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:22:42,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-28 20:22:42,260 INFO L87 Difference]: Start difference. First operand 79 states and 100 transitions. Second operand 5 states. [2019-11-28 20:22:42,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:42,342 INFO L93 Difference]: Finished difference Result 125 states and 159 transitions. [2019-11-28 20:22:42,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:22:42,346 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-28 20:22:42,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:42,347 INFO L225 Difference]: With dead ends: 125 [2019-11-28 20:22:42,347 INFO L226 Difference]: Without dead ends: 75 [2019-11-28 20:22:42,349 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-11-28 20:22:42,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-11-28 20:22:42,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2019-11-28 20:22:42,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-28 20:22:42,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 92 transitions. [2019-11-28 20:22:42,362 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 92 transitions. Word has length 19 [2019-11-28 20:22:42,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:42,363 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 92 transitions. [2019-11-28 20:22:42,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 20:22:42,363 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 92 transitions. [2019-11-28 20:22:42,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 20:22:42,364 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:42,365 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:22:42,572 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:42,572 INFO L410 AbstractCegarLoop]: === Iteration 8 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:42,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:42,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1643853139, now seen corresponding path program 1 times [2019-11-28 20:22:42,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:42,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073660745] [2019-11-28 20:22:42,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:42,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:42,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:42,648 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 20:22:42,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073660745] [2019-11-28 20:22:42,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:22:42,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 20:22:42,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461963700] [2019-11-28 20:22:42,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 20:22:42,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:42,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:22:42,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:22:42,651 INFO L87 Difference]: Start difference. First operand 73 states and 92 transitions. Second operand 6 states. [2019-11-28 20:22:42,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:42,737 INFO L93 Difference]: Finished difference Result 149 states and 206 transitions. [2019-11-28 20:22:42,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 20:22:42,737 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-11-28 20:22:42,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:42,739 INFO L225 Difference]: With dead ends: 149 [2019-11-28 20:22:42,739 INFO L226 Difference]: Without dead ends: 91 [2019-11-28 20:22:42,742 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-28 20:22:42,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-28 20:22:42,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 79. [2019-11-28 20:22:42,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-28 20:22:42,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 99 transitions. [2019-11-28 20:22:42,754 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 99 transitions. Word has length 21 [2019-11-28 20:22:42,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:42,755 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 99 transitions. [2019-11-28 20:22:42,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 20:22:42,755 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 99 transitions. [2019-11-28 20:22:42,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 20:22:42,756 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:42,756 INFO L410 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:22:42,757 INFO L410 AbstractCegarLoop]: === Iteration 9 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:42,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:42,757 INFO L82 PathProgramCache]: Analyzing trace with hash 883505486, now seen corresponding path program 1 times [2019-11-28 20:22:42,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:42,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793324769] [2019-11-28 20:22:42,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:42,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:42,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:42,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:42,821 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-28 20:22:42,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793324769] [2019-11-28 20:22:42,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:22:42,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 20:22:42,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873225499] [2019-11-28 20:22:42,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 20:22:42,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:42,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:22:42,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:22:42,824 INFO L87 Difference]: Start difference. First operand 79 states and 99 transitions. Second operand 6 states. [2019-11-28 20:22:42,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:42,894 INFO L93 Difference]: Finished difference Result 158 states and 210 transitions. [2019-11-28 20:22:42,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 20:22:42,895 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-11-28 20:22:42,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:42,897 INFO L225 Difference]: With dead ends: 158 [2019-11-28 20:22:42,897 INFO L226 Difference]: Without dead ends: 95 [2019-11-28 20:22:42,898 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:22:42,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-11-28 20:22:42,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 87. [2019-11-28 20:22:42,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-28 20:22:42,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 108 transitions. [2019-11-28 20:22:42,911 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 108 transitions. Word has length 27 [2019-11-28 20:22:42,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:42,912 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 108 transitions. [2019-11-28 20:22:42,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 20:22:42,912 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 108 transitions. [2019-11-28 20:22:42,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-28 20:22:42,914 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:42,914 INFO L410 BasicCegarLoop]: trace histogram [5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:22:42,914 INFO L410 AbstractCegarLoop]: === Iteration 10 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:42,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:42,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1291302577, now seen corresponding path program 1 times [2019-11-28 20:22:42,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:42,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935876715] [2019-11-28 20:22:42,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:42,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:42,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:42,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:42,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:42,976 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-28 20:22:42,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935876715] [2019-11-28 20:22:42,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:22:42,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:22:42,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562734973] [2019-11-28 20:22:42,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:22:42,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:42,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:22:42,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:22:42,984 INFO L87 Difference]: Start difference. First operand 87 states and 108 transitions. Second operand 4 states. [2019-11-28 20:22:43,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:43,018 INFO L93 Difference]: Finished difference Result 94 states and 118 transitions. [2019-11-28 20:22:43,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:22:43,019 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-28 20:22:43,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:43,022 INFO L225 Difference]: With dead ends: 94 [2019-11-28 20:22:43,022 INFO L226 Difference]: Without dead ends: 93 [2019-11-28 20:22:43,023 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:22:43,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-11-28 20:22:43,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2019-11-28 20:22:43,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-28 20:22:43,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 112 transitions. [2019-11-28 20:22:43,048 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 112 transitions. Word has length 35 [2019-11-28 20:22:43,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:43,049 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 112 transitions. [2019-11-28 20:22:43,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:22:43,049 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 112 transitions. [2019-11-28 20:22:43,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-28 20:22:43,051 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:43,051 INFO L410 BasicCegarLoop]: trace histogram [5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:22:43,051 INFO L410 AbstractCegarLoop]: === Iteration 11 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:43,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:43,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1375674171, now seen corresponding path program 1 times [2019-11-28 20:22:43,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:43,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975944428] [2019-11-28 20:22:43,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:43,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:43,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:43,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:43,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:43,103 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-28 20:22:43,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975944428] [2019-11-28 20:22:43,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:22:43,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:22:43,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591572707] [2019-11-28 20:22:43,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:22:43,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:43,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:22:43,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:22:43,106 INFO L87 Difference]: Start difference. First operand 91 states and 112 transitions. Second operand 3 states. [2019-11-28 20:22:43,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:43,132 INFO L93 Difference]: Finished difference Result 91 states and 112 transitions. [2019-11-28 20:22:43,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:22:43,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-28 20:22:43,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:43,134 INFO L225 Difference]: With dead ends: 91 [2019-11-28 20:22:43,134 INFO L226 Difference]: Without dead ends: 90 [2019-11-28 20:22:43,135 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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:22:43,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-11-28 20:22:43,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-11-28 20:22:43,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-11-28 20:22:43,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 110 transitions. [2019-11-28 20:22:43,152 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 110 transitions. Word has length 36 [2019-11-28 20:22:43,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:43,153 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 110 transitions. [2019-11-28 20:22:43,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:22:43,153 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 110 transitions. [2019-11-28 20:22:43,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-28 20:22:43,154 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:43,154 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:22:43,155 INFO L410 AbstractCegarLoop]: === Iteration 12 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:43,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:43,155 INFO L82 PathProgramCache]: Analyzing trace with hash 930510463, now seen corresponding path program 1 times [2019-11-28 20:22:43,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:43,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870660542] [2019-11-28 20:22:43,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:43,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:43,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:43,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:43,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:43,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:43,239 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-28 20:22:43,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870660542] [2019-11-28 20:22:43,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:22:43,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 20:22:43,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079189893] [2019-11-28 20:22:43,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 20:22:43,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:43,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:22:43,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:22:43,242 INFO L87 Difference]: Start difference. First operand 90 states and 110 transitions. Second operand 6 states. [2019-11-28 20:22:43,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:43,277 INFO L93 Difference]: Finished difference Result 90 states and 110 transitions. [2019-11-28 20:22:43,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 20:22:43,278 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2019-11-28 20:22:43,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:43,279 INFO L225 Difference]: With dead ends: 90 [2019-11-28 20:22:43,279 INFO L226 Difference]: Without dead ends: 89 [2019-11-28 20:22:43,280 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:22:43,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-28 20:22:43,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-11-28 20:22:43,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-28 20:22:43,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 108 transitions. [2019-11-28 20:22:43,289 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 108 transitions. Word has length 36 [2019-11-28 20:22:43,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:43,290 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 108 transitions. [2019-11-28 20:22:43,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 20:22:43,290 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 108 transitions. [2019-11-28 20:22:43,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-28 20:22:43,291 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:43,292 INFO L410 BasicCegarLoop]: trace histogram [6, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:22:43,292 INFO L410 AbstractCegarLoop]: === Iteration 13 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:43,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:43,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1111626321, now seen corresponding path program 1 times [2019-11-28 20:22:43,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:43,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336803] [2019-11-28 20:22:43,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:43,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:43,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:43,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:43,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:43,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:43,421 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-11-28 20:22:43,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336803] [2019-11-28 20:22:43,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:22:43,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 20:22:43,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603704286] [2019-11-28 20:22:43,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 20:22:43,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:43,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:22:43,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:22:43,432 INFO L87 Difference]: Start difference. First operand 89 states and 108 transitions. Second operand 6 states. [2019-11-28 20:22:43,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:43,489 INFO L93 Difference]: Finished difference Result 99 states and 120 transitions. [2019-11-28 20:22:43,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 20:22:43,490 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2019-11-28 20:22:43,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:43,491 INFO L225 Difference]: With dead ends: 99 [2019-11-28 20:22:43,492 INFO L226 Difference]: Without dead ends: 98 [2019-11-28 20:22:43,492 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:22:43,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-28 20:22:43,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 88. [2019-11-28 20:22:43,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-28 20:22:43,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 106 transitions. [2019-11-28 20:22:43,503 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 106 transitions. Word has length 46 [2019-11-28 20:22:43,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:43,503 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 106 transitions. [2019-11-28 20:22:43,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 20:22:43,504 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 106 transitions. [2019-11-28 20:22:43,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 20:22:43,505 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:43,505 INFO L410 BasicCegarLoop]: trace histogram [6, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:22:43,506 INFO L410 AbstractCegarLoop]: === Iteration 14 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:43,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:43,506 INFO L82 PathProgramCache]: Analyzing trace with hash 138300185, now seen corresponding path program 1 times [2019-11-28 20:22:43,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:43,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42718258] [2019-11-28 20:22:43,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:43,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:43,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:43,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:43,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:43,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:43,635 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-28 20:22:43,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42718258] [2019-11-28 20:22:43,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25985071] [2019-11-28 20:22:43,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:43,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:43,688 INFO L264 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 20:22:43,692 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:22:43,759 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-28 20:22:43,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 20:22:43,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2019-11-28 20:22:43,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535191364] [2019-11-28 20:22:43,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 20:22:43,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:43,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 20:22:43,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-11-28 20:22:43,761 INFO L87 Difference]: Start difference. First operand 88 states and 106 transitions. Second operand 7 states. [2019-11-28 20:22:43,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:43,967 INFO L93 Difference]: Finished difference Result 116 states and 141 transitions. [2019-11-28 20:22:43,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 20:22:43,967 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2019-11-28 20:22:43,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:43,969 INFO L225 Difference]: With dead ends: 116 [2019-11-28 20:22:43,969 INFO L226 Difference]: Without dead ends: 115 [2019-11-28 20:22:43,970 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2019-11-28 20:22:43,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-28 20:22:43,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2019-11-28 20:22:43,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-28 20:22:43,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 140 transitions. [2019-11-28 20:22:43,980 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 140 transitions. Word has length 45 [2019-11-28 20:22:43,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:43,981 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 140 transitions. [2019-11-28 20:22:43,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 20:22:43,981 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 140 transitions. [2019-11-28 20:22:43,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-28 20:22:43,982 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:43,982 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:22:44,195 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:44,196 INFO L410 AbstractCegarLoop]: === Iteration 15 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:44,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:44,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1156205799, now seen corresponding path program 1 times [2019-11-28 20:22:44,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:44,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933345948] [2019-11-28 20:22:44,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:44,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:44,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:44,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:44,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:44,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:44,327 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-28 20:22:44,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933345948] [2019-11-28 20:22:44,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509235191] [2019-11-28 20:22:44,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:44,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:44,385 INFO L264 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 20:22:44,388 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:22:44,398 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-28 20:22:44,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:22:44,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 10 [2019-11-28 20:22:44,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246399681] [2019-11-28 20:22:44,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 20:22:44,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:44,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 20:22:44,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-11-28 20:22:44,400 INFO L87 Difference]: Start difference. First operand 114 states and 140 transitions. Second operand 10 states. [2019-11-28 20:22:44,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:44,649 INFO L93 Difference]: Finished difference Result 224 states and 282 transitions. [2019-11-28 20:22:44,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 20:22:44,649 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2019-11-28 20:22:44,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:44,652 INFO L225 Difference]: With dead ends: 224 [2019-11-28 20:22:44,652 INFO L226 Difference]: Without dead ends: 145 [2019-11-28 20:22:44,653 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-11-28 20:22:44,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-11-28 20:22:44,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 132. [2019-11-28 20:22:44,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-28 20:22:44,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 164 transitions. [2019-11-28 20:22:44,672 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 164 transitions. Word has length 43 [2019-11-28 20:22:44,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:44,673 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 164 transitions. [2019-11-28 20:22:44,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 20:22:44,674 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 164 transitions. [2019-11-28 20:22:44,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-28 20:22:44,675 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:44,676 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:22:44,884 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:44,885 INFO L410 AbstractCegarLoop]: === Iteration 16 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:44,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:44,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1154921966, now seen corresponding path program 1 times [2019-11-28 20:22:44,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:44,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614322172] [2019-11-28 20:22:44,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:44,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:44,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:44,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:44,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:44,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:44,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:44,918 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-28 20:22:44,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614322172] [2019-11-28 20:22:44,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:22:44,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:22:44,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131366269] [2019-11-28 20:22:44,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:22:44,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:44,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:22:44,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:22:44,920 INFO L87 Difference]: Start difference. First operand 132 states and 164 transitions. Second operand 3 states. [2019-11-28 20:22:44,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:44,931 INFO L93 Difference]: Finished difference Result 132 states and 164 transitions. [2019-11-28 20:22:44,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:22:44,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-28 20:22:44,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:44,933 INFO L225 Difference]: With dead ends: 132 [2019-11-28 20:22:44,933 INFO L226 Difference]: Without dead ends: 131 [2019-11-28 20:22:44,933 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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:22:44,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-28 20:22:44,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2019-11-28 20:22:44,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-11-28 20:22:44,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 162 transitions. [2019-11-28 20:22:44,942 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 162 transitions. Word has length 43 [2019-11-28 20:22:44,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:44,942 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 162 transitions. [2019-11-28 20:22:44,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:22:44,943 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 162 transitions. [2019-11-28 20:22:44,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-28 20:22:44,943 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:44,943 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:22:44,944 INFO L410 AbstractCegarLoop]: === Iteration 17 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:44,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:44,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1442842648, now seen corresponding path program 1 times [2019-11-28 20:22:44,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:44,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231489801] [2019-11-28 20:22:44,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:44,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:44,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:44,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:44,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:44,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:44,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:44,977 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-28 20:22:44,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231489801] [2019-11-28 20:22:44,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:22:44,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:22:44,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284470516] [2019-11-28 20:22:44,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:22:44,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:44,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:22:44,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:22:44,980 INFO L87 Difference]: Start difference. First operand 131 states and 162 transitions. Second operand 4 states. [2019-11-28 20:22:45,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:45,000 INFO L93 Difference]: Finished difference Result 140 states and 172 transitions. [2019-11-28 20:22:45,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:22:45,001 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-11-28 20:22:45,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:45,002 INFO L225 Difference]: With dead ends: 140 [2019-11-28 20:22:45,002 INFO L226 Difference]: Without dead ends: 132 [2019-11-28 20:22:45,003 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:22:45,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-11-28 20:22:45,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2019-11-28 20:22:45,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-28 20:22:45,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 161 transitions. [2019-11-28 20:22:45,012 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 161 transitions. Word has length 44 [2019-11-28 20:22:45,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:45,012 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 161 transitions. [2019-11-28 20:22:45,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:22:45,012 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 161 transitions. [2019-11-28 20:22:45,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-28 20:22:45,013 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:45,013 INFO L410 BasicCegarLoop]: trace histogram [10, 8, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-28 20:22:45,014 INFO L410 AbstractCegarLoop]: === Iteration 18 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:45,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:45,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1995865818, now seen corresponding path program 2 times [2019-11-28 20:22:45,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:45,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986586940] [2019-11-28 20:22:45,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:45,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:45,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:45,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:45,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:45,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:45,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:45,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:45,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:45,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:45,215 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 60 proven. 32 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-11-28 20:22:45,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986586940] [2019-11-28 20:22:45,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432758243] [2019-11-28 20:22:45,216 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:45,269 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 20:22:45,270 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:22:45,271 INFO L264 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 20:22:45,281 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:22:45,320 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 64 proven. 28 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-11-28 20:22:45,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:22:45,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 13 [2019-11-28 20:22:45,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884777841] [2019-11-28 20:22:45,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 20:22:45,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:45,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 20:22:45,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-11-28 20:22:45,323 INFO L87 Difference]: Start difference. First operand 132 states and 161 transitions. Second operand 13 states. [2019-11-28 20:22:45,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:45,523 INFO L93 Difference]: Finished difference Result 155 states and 185 transitions. [2019-11-28 20:22:45,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 20:22:45,524 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 75 [2019-11-28 20:22:45,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:45,525 INFO L225 Difference]: With dead ends: 155 [2019-11-28 20:22:45,525 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 20:22:45,526 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2019-11-28 20:22:45,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 20:22:45,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 20:22:45,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 20:22:45,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 20:22:45,528 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 75 [2019-11-28 20:22:45,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:45,528 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:22:45,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 20:22:45,528 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 20:22:45,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 20:22:45,733 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:45,736 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 20:22:46,208 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 14 [2019-11-28 20:22:46,333 INFO L246 CegarLoopResult]: For program point rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-11-28 20:22:46,333 INFO L246 CegarLoopResult]: For program point rec1FINAL(lines 11 15) no Hoare annotation was computed. [2019-11-28 20:22:46,333 INFO L246 CegarLoopResult]: For program point rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-11-28 20:22:46,333 INFO L246 CegarLoopResult]: For program point rec1EXIT(lines 11 15) no Hoare annotation was computed. [2019-11-28 20:22:46,333 INFO L246 CegarLoopResult]: For program point L14(line 14) no Hoare annotation was computed. [2019-11-28 20:22:46,334 INFO L249 CegarLoopResult]: At program point rec1ENTRY(lines 11 15) the Hoare annotation is: true [2019-11-28 20:22:46,334 INFO L246 CegarLoopResult]: For program point L14-1(line 14) no Hoare annotation was computed. [2019-11-28 20:22:46,334 INFO L246 CegarLoopResult]: For program point L12(lines 12 13) no Hoare annotation was computed. [2019-11-28 20:22:46,334 INFO L242 CegarLoopResult]: At program point L14-2(line 14) the Hoare annotation is: (or (not (<= |rec1_#in~i| 2147483647)) (and (= |rec1_#in~i| rec1_~i) (<= 1 rec1_~i))) [2019-11-28 20:22:46,334 INFO L246 CegarLoopResult]: For program point L14-3(line 14) no Hoare annotation was computed. [2019-11-28 20:22:46,334 INFO L246 CegarLoopResult]: For program point L14-4(line 14) no Hoare annotation was computed. [2019-11-28 20:22:46,334 INFO L246 CegarLoopResult]: For program point rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-11-28 20:22:46,335 INFO L246 CegarLoopResult]: For program point L14-5(line 14) no Hoare annotation was computed. [2019-11-28 20:22:46,335 INFO L242 CegarLoopResult]: At program point L14-6(line 14) the Hoare annotation is: (let ((.cse0 (not (<= |rec1_#in~i| 2147483647)))) (and (or .cse0 (= |rec1_#in~i| rec1_~i)) (or .cse0 (and (<= |rec1_#t~ret0| 1) (<= 1 rec1_~i))))) [2019-11-28 20:22:46,335 INFO L246 CegarLoopResult]: For program point rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-11-28 20:22:46,335 INFO L246 CegarLoopResult]: For program point rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-11-28 20:22:46,335 INFO L246 CegarLoopResult]: For program point L14-7(line 14) no Hoare annotation was computed. [2019-11-28 20:22:46,335 INFO L246 CegarLoopResult]: For program point rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-11-28 20:22:46,335 INFO L242 CegarLoopResult]: At program point L14-8(line 14) the Hoare annotation is: (let ((.cse0 (not (<= |rec1_#in~i| 2147483647)))) (and (or (and (<= |rec1_#t~ret1| 0) (<= 1 rec1_~i)) .cse0) (or (and (= |rec1_#in~i| rec1_~i) (<= |rec1_#t~ret0| 1)) .cse0))) [2019-11-28 20:22:46,335 INFO L246 CegarLoopResult]: For program point L14-9(line 14) no Hoare annotation was computed. [2019-11-28 20:22:46,336 INFO L246 CegarLoopResult]: For program point L14-10(line 14) no Hoare annotation was computed. [2019-11-28 20:22:46,337 INFO L246 CegarLoopResult]: For program point L14-11(line 14) no Hoare annotation was computed. [2019-11-28 20:22:46,337 INFO L246 CegarLoopResult]: For program point rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-28 20:22:46,337 INFO L246 CegarLoopResult]: For program point rec2FINAL(lines 17 21) no Hoare annotation was computed. [2019-11-28 20:22:46,337 INFO L246 CegarLoopResult]: For program point rec2EXIT(lines 17 21) no Hoare annotation was computed. [2019-11-28 20:22:46,337 INFO L242 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (and (or (and (<= rec2_~j 2147483647) (<= 1 rec2_~j)) (not (<= |rec2_#in~j| 2147483647))) (not (<= |rec2_#in~j| 0))) [2019-11-28 20:22:46,337 INFO L246 CegarLoopResult]: For program point L20-1(line 20) no Hoare annotation was computed. [2019-11-28 20:22:46,337 INFO L246 CegarLoopResult]: For program point L18(lines 18 19) no Hoare annotation was computed. [2019-11-28 20:22:46,337 INFO L246 CegarLoopResult]: For program point L20-2(line 20) no Hoare annotation was computed. [2019-11-28 20:22:46,338 INFO L246 CegarLoopResult]: For program point L20-3(line 20) no Hoare annotation was computed. [2019-11-28 20:22:46,338 INFO L242 CegarLoopResult]: At program point L20-4(line 20) the Hoare annotation is: (and (or (and (<= rec2_~j 2147483647) (<= |rec2_#t~ret3| 1) (<= 1 rec2_~j) (<= 1 |rec2_#t~ret3|)) (not (<= |rec2_#in~j| 2147483647))) (not (<= |rec2_#in~j| 0))) [2019-11-28 20:22:46,338 INFO L246 CegarLoopResult]: For program point L20-5(line 20) no Hoare annotation was computed. [2019-11-28 20:22:46,338 INFO L246 CegarLoopResult]: For program point L20-6(line 20) no Hoare annotation was computed. [2019-11-28 20:22:46,338 INFO L246 CegarLoopResult]: For program point L20-7(line 20) no Hoare annotation was computed. [2019-11-28 20:22:46,338 INFO L249 CegarLoopResult]: At program point rec2ENTRY(lines 17 21) the Hoare annotation is: true [2019-11-28 20:22:46,338 INFO L246 CegarLoopResult]: For program point rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-28 20:22:46,339 INFO L246 CegarLoopResult]: For program point rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-28 20:22:46,339 INFO L246 CegarLoopResult]: For program point rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-28 20:22:46,339 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 20:22:46,339 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 20:22:46,339 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 20:22:46,339 INFO L242 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: (<= ULTIMATE.start_main_~x~0 2147483647) [2019-11-28 20:22:46,339 INFO L246 CegarLoopResult]: For program point L25-1(line 25) no Hoare annotation was computed. [2019-11-28 20:22:46,339 INFO L246 CegarLoopResult]: For program point L23(lines 23 26) no Hoare annotation was computed. [2019-11-28 20:22:46,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:22:46 BoogieIcfgContainer [2019-11-28 20:22:46,347 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 20:22:46,347 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:22:46,348 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:22:46,348 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:22:46,348 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:22:40" (3/4) ... [2019-11-28 20:22:46,353 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 20:22:46,361 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure rec1 [2019-11-28 20:22:46,361 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure rec2 [2019-11-28 20:22:46,371 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-28 20:22:46,372 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 20:22:46,449 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 20:22:46,449 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:22:46,451 INFO L168 Benchmark]: Toolchain (without parser) took 6367.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 205.5 MB). Free memory was 961.7 MB in the beginning and 991.8 MB in the end (delta: -30.1 MB). Peak memory consumption was 175.5 MB. Max. memory is 11.5 GB. [2019-11-28 20:22:46,452 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:22:46,452 INFO L168 Benchmark]: CACSL2BoogieTranslator took 231.87 ms. Allocated memory is still 1.0 GB. Free memory was 961.7 MB in the beginning and 951.0 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:22:46,452 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.38 ms. Allocated memory is still 1.0 GB. Free memory is still 951.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:22:46,453 INFO L168 Benchmark]: Boogie Preprocessor took 75.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -184.6 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:22:46,453 INFO L168 Benchmark]: RCFGBuilder took 323.14 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: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. [2019-11-28 20:22:46,455 INFO L168 Benchmark]: TraceAbstraction took 5602.76 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.6 MB). Free memory was 1.1 GB in the beginning and 991.8 MB in the end (delta: 117.2 MB). Peak memory consumption was 183.8 MB. Max. memory is 11.5 GB. [2019-11-28 20:22:46,456 INFO L168 Benchmark]: Witness Printer took 101.94 ms. Allocated memory is still 1.2 GB. Free memory is still 991.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:22:46,458 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.30 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 231.87 ms. Allocated memory is still 1.0 GB. Free memory was 961.7 MB in the beginning and 951.0 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 27.38 ms. Allocated memory is still 1.0 GB. Free memory is still 951.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 75.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -184.6 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 323.14 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: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5602.76 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.6 MB). Free memory was 1.1 GB in the beginning and 991.8 MB in the end (delta: 117.2 MB). Peak memory consumption was 183.8 MB. Max. memory is 11.5 GB. * Witness Printer took 101.94 ms. Allocated memory is still 1.2 GB. Free memory is still 991.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 44 locations, 10 error locations. Result: SAFE, OverallTime: 4.9s, OverallIterations: 18, TraceHistogramMax: 10, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, HoareTripleCheckerStatistics: 687 SDtfs, 232 SDslu, 1730 SDs, 0 SdLazy, 623 SolverSat, 63 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 382 GetRequests, 285 SyntacticMatches, 1 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=132occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 89 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 225 PreInvPairs, 234 NumberOfFragments, 103 HoareAnnotationTreeSize, 225 FomulaSimplifications, 618 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 8 FomulaSimplificationsInter, 217 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 725 NumberOfCodeBlocks, 725 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 703 ConstructedInterpolants, 0 QuantifiedInterpolants, 49059 SizeOfPredicates, 6 NumberOfNonLiveVariables, 386 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 22 InterpolantComputations, 16 PerfectInterpolantSequences, 688/756 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...