./Ultimate.py --spec /storage/repos/svcomp/c/properties/no-overflow.prp --file /storage/repos/svcomp/c/termination-crafted/NestedRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 2e94e6aa Calling Ultimate with: 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 /storage/repos/svcomp/c/termination-crafted/NestedRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.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 cb528549fa76ae8087cf7043645dfa20323a0116 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 20:34:18,994 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 20:34:18,996 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 20:34:19,008 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 20:34:19,008 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 20:34:19,009 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 20:34:19,013 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 20:34:19,015 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 20:34:19,018 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 20:34:19,018 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 20:34:19,021 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 20:34:19,028 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 20:34:19,029 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 20:34:19,030 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 20:34:19,031 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 20:34:19,032 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 20:34:19,033 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 20:34:19,035 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 20:34:19,037 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 20:34:19,039 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 20:34:19,041 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 20:34:19,043 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 20:34:19,045 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 20:34:19,049 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 20:34:19,049 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 20:34:19,050 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 20:34:19,053 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 20:34:19,054 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 20:34:19,055 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 20:34:19,058 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 20:34:19,059 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 20:34:19,060 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 20:34:19,060 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 20:34:19,060 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 20:34:19,063 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 20:34:19,063 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 20:34:19,064 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-01-01 20:34:19,083 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 20:34:19,083 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 20:34:19,086 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 20:34:19,087 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 20:34:19,091 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 20:34:19,091 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 20:34:19,091 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 20:34:19,091 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 20:34:19,092 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 20:34:19,092 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-01 20:34:19,092 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 20:34:19,092 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-01 20:34:19,092 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2019-01-01 20:34:19,092 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 20:34:19,093 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 20:34:19,093 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-01 20:34:19,093 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 20:34:19,093 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 20:34:19,093 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 20:34:19,093 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 20:34:19,095 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 20:34:19,095 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 20:34:19,095 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 20:34:19,096 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-01 20:34:19,096 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 20:34:19,096 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 20:34:19,096 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-01 20:34:19,096 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /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 -> cb528549fa76ae8087cf7043645dfa20323a0116 [2019-01-01 20:34:19,167 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 20:34:19,184 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 20:34:19,191 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 20:34:19,192 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 20:34:19,194 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 20:34:19,195 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted/NestedRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c [2019-01-01 20:34:19,263 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f72d60587/dc691c2e582340aeb31d64b7d56fc3b0/FLAG3465e0908 [2019-01-01 20:34:19,666 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 20:34:19,666 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted/NestedRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c [2019-01-01 20:34:19,674 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f72d60587/dc691c2e582340aeb31d64b7d56fc3b0/FLAG3465e0908 [2019-01-01 20:34:20,053 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f72d60587/dc691c2e582340aeb31d64b7d56fc3b0 [2019-01-01 20:34:20,057 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 20:34:20,058 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 20:34:20,059 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 20:34:20,059 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 20:34:20,063 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 20:34:20,064 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 08:34:20" (1/1) ... [2019-01-01 20:34:20,068 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21b435d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:20, skipping insertion in model container [2019-01-01 20:34:20,069 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 08:34:20" (1/1) ... [2019-01-01 20:34:20,078 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 20:34:20,096 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 20:34:20,317 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 20:34:20,325 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 20:34:20,349 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 20:34:20,369 INFO L195 MainTranslator]: Completed translation [2019-01-01 20:34:20,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:20 WrapperNode [2019-01-01 20:34:20,370 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 20:34:20,371 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 20:34:20,371 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 20:34:20,371 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 20:34:20,382 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:20" (1/1) ... [2019-01-01 20:34:20,388 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:20" (1/1) ... [2019-01-01 20:34:20,418 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 20:34:20,418 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 20:34:20,419 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 20:34:20,419 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 20:34:20,430 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:20" (1/1) ... [2019-01-01 20:34:20,431 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:20" (1/1) ... [2019-01-01 20:34:20,432 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:20" (1/1) ... [2019-01-01 20:34:20,432 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:20" (1/1) ... [2019-01-01 20:34:20,434 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:20" (1/1) ... [2019-01-01 20:34:20,437 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:20" (1/1) ... [2019-01-01 20:34:20,438 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:20" (1/1) ... [2019-01-01 20:34:20,445 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 20:34:20,445 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 20:34:20,446 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 20:34:20,446 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 20:34:20,447 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:20" (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-01-01 20:34:20,585 INFO L130 BoogieDeclarations]: Found specification of procedure rec1 [2019-01-01 20:34:20,585 INFO L138 BoogieDeclarations]: Found implementation of procedure rec1 [2019-01-01 20:34:20,585 INFO L130 BoogieDeclarations]: Found specification of procedure rec2 [2019-01-01 20:34:20,586 INFO L138 BoogieDeclarations]: Found implementation of procedure rec2 [2019-01-01 20:34:20,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 20:34:20,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 20:34:21,201 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 20:34:21,201 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-01 20:34:21,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 08:34:21 BoogieIcfgContainer [2019-01-01 20:34:21,202 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 20:34:21,203 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 20:34:21,203 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 20:34:21,206 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 20:34:21,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 08:34:20" (1/3) ... [2019-01-01 20:34:21,207 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@658409f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 08:34:21, skipping insertion in model container [2019-01-01 20:34:21,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:20" (2/3) ... [2019-01-01 20:34:21,208 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@658409f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 08:34:21, skipping insertion in model container [2019-01-01 20:34:21,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 08:34:21" (3/3) ... [2019-01-01 20:34:21,210 INFO L112 eAbstractionObserver]: Analyzing ICFG NestedRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c [2019-01-01 20:34:21,220 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 20:34:21,228 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2019-01-01 20:34:21,247 INFO L257 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2019-01-01 20:34:21,280 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 20:34:21,281 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 20:34:21,281 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-01 20:34:21,282 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 20:34:21,282 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 20:34:21,282 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 20:34:21,282 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 20:34:21,283 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 20:34:21,283 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 20:34:21,304 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2019-01-01 20:34:21,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-01 20:34:21,311 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:21,312 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-01 20:34:21,314 INFO L423 AbstractCegarLoop]: === Iteration 1 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:21,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:21,321 INFO L82 PathProgramCache]: Analyzing trace with hash 70122184, now seen corresponding path program 1 times [2019-01-01 20:34:21,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:21,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:21,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:21,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:21,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:21,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:21,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:21,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:21,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 20:34:21,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 20:34:21,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 20:34:21,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 20:34:21,542 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 5 states. [2019-01-01 20:34:21,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:21,738 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2019-01-01 20:34:21,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 20:34:21,740 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-01-01 20:34:21,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:21,752 INFO L225 Difference]: With dead ends: 62 [2019-01-01 20:34:21,752 INFO L226 Difference]: Without dead ends: 55 [2019-01-01 20:34:21,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 20:34:21,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-01 20:34:21,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2019-01-01 20:34:21,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-01 20:34:21,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2019-01-01 20:34:21,811 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 5 [2019-01-01 20:34:21,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:21,811 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2019-01-01 20:34:21,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 20:34:21,812 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2019-01-01 20:34:21,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-01 20:34:21,812 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:21,812 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-01 20:34:21,813 INFO L423 AbstractCegarLoop]: === Iteration 2 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:21,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:21,814 INFO L82 PathProgramCache]: Analyzing trace with hash -2121179530, now seen corresponding path program 1 times [2019-01-01 20:34:21,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:21,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:21,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:21,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:21,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:21,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:21,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:21,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:21,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 20:34:21,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 20:34:21,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 20:34:21,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 20:34:21,865 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand 3 states. [2019-01-01 20:34:21,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:21,942 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2019-01-01 20:34:21,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 20:34:21,943 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-01-01 20:34:21,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:21,944 INFO L225 Difference]: With dead ends: 52 [2019-01-01 20:34:21,944 INFO L226 Difference]: Without dead ends: 51 [2019-01-01 20:34:21,946 INFO L631 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-01-01 20:34:21,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-01 20:34:21,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2019-01-01 20:34:21,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-01 20:34:21,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2019-01-01 20:34:21,957 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 6 [2019-01-01 20:34:21,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:21,957 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2019-01-01 20:34:21,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 20:34:21,957 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2019-01-01 20:34:21,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-01 20:34:21,958 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:21,958 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:21,959 INFO L423 AbstractCegarLoop]: === Iteration 3 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:21,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:21,959 INFO L82 PathProgramCache]: Analyzing trace with hash -2074588191, now seen corresponding path program 1 times [2019-01-01 20:34:21,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:21,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:21,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:21,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:21,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:21,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:22,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:22,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:22,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 20:34:22,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 20:34:22,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 20:34:22,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 20:34:22,031 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand 5 states. [2019-01-01 20:34:22,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:22,459 INFO L93 Difference]: Finished difference Result 73 states and 88 transitions. [2019-01-01 20:34:22,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 20:34:22,461 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-01-01 20:34:22,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:22,463 INFO L225 Difference]: With dead ends: 73 [2019-01-01 20:34:22,463 INFO L226 Difference]: Without dead ends: 72 [2019-01-01 20:34:22,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 20:34:22,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-01 20:34:22,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 65. [2019-01-01 20:34:22,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-01 20:34:22,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 81 transitions. [2019-01-01 20:34:22,480 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 81 transitions. Word has length 10 [2019-01-01 20:34:22,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:22,481 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 81 transitions. [2019-01-01 20:34:22,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 20:34:22,481 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 81 transitions. [2019-01-01 20:34:22,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-01 20:34:22,482 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:22,482 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:22,483 INFO L423 AbstractCegarLoop]: === Iteration 4 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:22,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:22,483 INFO L82 PathProgramCache]: Analyzing trace with hash 112275557, now seen corresponding path program 1 times [2019-01-01 20:34:22,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:22,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:22,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:22,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:22,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:22,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:22,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:22,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:22,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 20:34:22,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 20:34:22,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 20:34:22,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 20:34:22,521 INFO L87 Difference]: Start difference. First operand 65 states and 81 transitions. Second operand 3 states. [2019-01-01 20:34:22,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:22,545 INFO L93 Difference]: Finished difference Result 69 states and 91 transitions. [2019-01-01 20:34:22,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 20:34:22,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-01-01 20:34:22,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:22,549 INFO L225 Difference]: With dead ends: 69 [2019-01-01 20:34:22,550 INFO L226 Difference]: Without dead ends: 68 [2019-01-01 20:34:22,550 INFO L631 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-01-01 20:34:22,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-01 20:34:22,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2019-01-01 20:34:22,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-01 20:34:22,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2019-01-01 20:34:22,564 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 11 [2019-01-01 20:34:22,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:22,565 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2019-01-01 20:34:22,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 20:34:22,565 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2019-01-01 20:34:22,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-01 20:34:22,566 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:22,566 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:22,566 INFO L423 AbstractCegarLoop]: === Iteration 5 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:22,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:22,567 INFO L82 PathProgramCache]: Analyzing trace with hash -2048531074, now seen corresponding path program 1 times [2019-01-01 20:34:22,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:22,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:22,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:22,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:22,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:22,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:22,660 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:22,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:22,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 20:34:22,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 20:34:22,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 20:34:22,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 20:34:22,663 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand 5 states. [2019-01-01 20:34:22,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:22,895 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2019-01-01 20:34:22,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 20:34:22,896 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-01-01 20:34:22,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:22,897 INFO L225 Difference]: With dead ends: 66 [2019-01-01 20:34:22,897 INFO L226 Difference]: Without dead ends: 65 [2019-01-01 20:34:22,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-01 20:34:22,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-01 20:34:22,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2019-01-01 20:34:22,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-01 20:34:22,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 78 transitions. [2019-01-01 20:34:22,908 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 78 transitions. Word has length 16 [2019-01-01 20:34:22,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:22,909 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 78 transitions. [2019-01-01 20:34:22,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 20:34:22,909 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 78 transitions. [2019-01-01 20:34:22,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-01 20:34:22,910 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:22,910 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:22,911 INFO L423 AbstractCegarLoop]: === Iteration 6 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:22,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:22,911 INFO L82 PathProgramCache]: Analyzing trace with hash -57180086, now seen corresponding path program 1 times [2019-01-01 20:34:22,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:22,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:22,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:22,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:22,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:22,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:22,960 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 20:34:22,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:22,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 20:34:22,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 20:34:22,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 20:34:22,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 20:34:22,961 INFO L87 Difference]: Start difference. First operand 63 states and 78 transitions. Second operand 3 states. [2019-01-01 20:34:22,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:22,985 INFO L93 Difference]: Finished difference Result 63 states and 78 transitions. [2019-01-01 20:34:22,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 20:34:22,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-01-01 20:34:22,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:22,990 INFO L225 Difference]: With dead ends: 63 [2019-01-01 20:34:22,990 INFO L226 Difference]: Without dead ends: 62 [2019-01-01 20:34:22,991 INFO L631 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-01-01 20:34:22,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-01-01 20:34:23,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-01-01 20:34:23,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-01 20:34:23,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 76 transitions. [2019-01-01 20:34:23,002 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 76 transitions. Word has length 18 [2019-01-01 20:34:23,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:23,002 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 76 transitions. [2019-01-01 20:34:23,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 20:34:23,002 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 76 transitions. [2019-01-01 20:34:23,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-01 20:34:23,004 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:23,005 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:23,005 INFO L423 AbstractCegarLoop]: === Iteration 7 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:23,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:23,006 INFO L82 PathProgramCache]: Analyzing trace with hash -599425808, now seen corresponding path program 1 times [2019-01-01 20:34:23,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:23,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:23,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:23,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:23,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:23,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:23,066 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 20:34:23,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:23,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 20:34:23,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 20:34:23,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 20:34:23,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 20:34:23,069 INFO L87 Difference]: Start difference. First operand 62 states and 76 transitions. Second operand 3 states. [2019-01-01 20:34:23,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:23,084 INFO L93 Difference]: Finished difference Result 62 states and 76 transitions. [2019-01-01 20:34:23,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 20:34:23,086 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-01-01 20:34:23,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:23,087 INFO L225 Difference]: With dead ends: 62 [2019-01-01 20:34:23,087 INFO L226 Difference]: Without dead ends: 61 [2019-01-01 20:34:23,088 INFO L631 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-01-01 20:34:23,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-01 20:34:23,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-01-01 20:34:23,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-01 20:34:23,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 74 transitions. [2019-01-01 20:34:23,096 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 74 transitions. Word has length 19 [2019-01-01 20:34:23,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:23,097 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 74 transitions. [2019-01-01 20:34:23,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 20:34:23,097 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 74 transitions. [2019-01-01 20:34:23,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-01 20:34:23,098 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:23,098 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:23,099 INFO L423 AbstractCegarLoop]: === Iteration 8 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:23,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:23,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1772582622, now seen corresponding path program 1 times [2019-01-01 20:34:23,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:23,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:23,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:23,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:23,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:23,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:23,157 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 20:34:23,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:23,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 20:34:23,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 20:34:23,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 20:34:23,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 20:34:23,161 INFO L87 Difference]: Start difference. First operand 61 states and 74 transitions. Second operand 4 states. [2019-01-01 20:34:23,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:23,197 INFO L93 Difference]: Finished difference Result 86 states and 116 transitions. [2019-01-01 20:34:23,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 20:34:23,198 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-01-01 20:34:23,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:23,200 INFO L225 Difference]: With dead ends: 86 [2019-01-01 20:34:23,200 INFO L226 Difference]: Without dead ends: 85 [2019-01-01 20:34:23,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-01-01 20:34:23,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-01 20:34:23,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 71. [2019-01-01 20:34:23,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-01 20:34:23,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 90 transitions. [2019-01-01 20:34:23,213 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 90 transitions. Word has length 19 [2019-01-01 20:34:23,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:23,214 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 90 transitions. [2019-01-01 20:34:23,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 20:34:23,214 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2019-01-01 20:34:23,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-01 20:34:23,215 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:23,215 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:23,216 INFO L423 AbstractCegarLoop]: === Iteration 9 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:23,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:23,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1402330794, now seen corresponding path program 1 times [2019-01-01 20:34:23,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:23,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:23,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:23,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:23,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:23,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:23,249 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 20:34:23,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:23,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 20:34:23,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 20:34:23,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 20:34:23,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 20:34:23,252 INFO L87 Difference]: Start difference. First operand 71 states and 90 transitions. Second operand 4 states. [2019-01-01 20:34:23,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:23,281 INFO L93 Difference]: Finished difference Result 80 states and 100 transitions. [2019-01-01 20:34:23,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 20:34:23,282 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-01-01 20:34:23,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:23,284 INFO L225 Difference]: With dead ends: 80 [2019-01-01 20:34:23,284 INFO L226 Difference]: Without dead ends: 76 [2019-01-01 20:34:23,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-01-01 20:34:23,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-01 20:34:23,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-01-01 20:34:23,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-01 20:34:23,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 95 transitions. [2019-01-01 20:34:23,310 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 95 transitions. Word has length 20 [2019-01-01 20:34:23,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:23,310 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 95 transitions. [2019-01-01 20:34:23,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 20:34:23,310 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 95 transitions. [2019-01-01 20:34:23,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-01 20:34:23,316 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:23,316 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:23,318 INFO L423 AbstractCegarLoop]: === Iteration 10 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:23,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:23,319 INFO L82 PathProgramCache]: Analyzing trace with hash 921726737, now seen corresponding path program 1 times [2019-01-01 20:34:23,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:23,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:23,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:23,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:23,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:23,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:23,375 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 20:34:23,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:23,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 20:34:23,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 20:34:23,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 20:34:23,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 20:34:23,377 INFO L87 Difference]: Start difference. First operand 76 states and 95 transitions. Second operand 5 states. [2019-01-01 20:34:23,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:23,787 INFO L93 Difference]: Finished difference Result 101 states and 125 transitions. [2019-01-01 20:34:23,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 20:34:23,788 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-01-01 20:34:23,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:23,790 INFO L225 Difference]: With dead ends: 101 [2019-01-01 20:34:23,790 INFO L226 Difference]: Without dead ends: 100 [2019-01-01 20:34:23,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-01 20:34:23,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-01-01 20:34:23,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2019-01-01 20:34:23,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-01 20:34:23,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 124 transitions. [2019-01-01 20:34:23,803 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 124 transitions. Word has length 23 [2019-01-01 20:34:23,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:23,804 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 124 transitions. [2019-01-01 20:34:23,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 20:34:23,804 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 124 transitions. [2019-01-01 20:34:23,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-01 20:34:23,805 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:23,806 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:23,806 INFO L423 AbstractCegarLoop]: === Iteration 11 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:23,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:23,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1139780748, now seen corresponding path program 1 times [2019-01-01 20:34:23,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:23,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:23,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:23,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:23,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:23,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:23,890 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-01 20:34:23,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:23,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 20:34:23,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 20:34:23,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 20:34:23,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 20:34:23,892 INFO L87 Difference]: Start difference. First operand 97 states and 124 transitions. Second operand 5 states. [2019-01-01 20:34:24,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:24,110 INFO L93 Difference]: Finished difference Result 100 states and 124 transitions. [2019-01-01 20:34:24,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 20:34:24,112 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-01-01 20:34:24,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:24,116 INFO L225 Difference]: With dead ends: 100 [2019-01-01 20:34:24,116 INFO L226 Difference]: Without dead ends: 99 [2019-01-01 20:34:24,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-01 20:34:24,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-01 20:34:24,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2019-01-01 20:34:24,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-01 20:34:24,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 123 transitions. [2019-01-01 20:34:24,129 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 123 transitions. Word has length 29 [2019-01-01 20:34:24,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:24,129 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 123 transitions. [2019-01-01 20:34:24,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 20:34:24,131 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 123 transitions. [2019-01-01 20:34:24,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-01 20:34:24,133 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:24,133 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:24,134 INFO L423 AbstractCegarLoop]: === Iteration 12 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:24,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:24,134 INFO L82 PathProgramCache]: Analyzing trace with hash 962359202, now seen corresponding path program 1 times [2019-01-01 20:34:24,134 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:24,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:24,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:24,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:24,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:24,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:24,212 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-01-01 20:34:24,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:24,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 20:34:24,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 20:34:24,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 20:34:24,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 20:34:24,215 INFO L87 Difference]: Start difference. First operand 96 states and 123 transitions. Second operand 4 states. [2019-01-01 20:34:24,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:24,258 INFO L93 Difference]: Finished difference Result 106 states and 138 transitions. [2019-01-01 20:34:24,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 20:34:24,259 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2019-01-01 20:34:24,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:24,262 INFO L225 Difference]: With dead ends: 106 [2019-01-01 20:34:24,262 INFO L226 Difference]: Without dead ends: 105 [2019-01-01 20:34:24,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-01-01 20:34:24,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-01 20:34:24,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 102. [2019-01-01 20:34:24,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-01 20:34:24,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 129 transitions. [2019-01-01 20:34:24,273 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 129 transitions. Word has length 43 [2019-01-01 20:34:24,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:24,274 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 129 transitions. [2019-01-01 20:34:24,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 20:34:24,274 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 129 transitions. [2019-01-01 20:34:24,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-01 20:34:24,276 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:24,276 INFO L402 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, 1, 1] [2019-01-01 20:34:24,277 INFO L423 AbstractCegarLoop]: === Iteration 13 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:24,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:24,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1793772729, now seen corresponding path program 1 times [2019-01-01 20:34:24,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:24,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:24,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:24,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:24,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:24,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:24,371 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-01-01 20:34:24,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:24,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 20:34:24,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 20:34:24,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 20:34:24,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 20:34:24,374 INFO L87 Difference]: Start difference. First operand 102 states and 129 transitions. Second operand 3 states. [2019-01-01 20:34:24,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:24,423 INFO L93 Difference]: Finished difference Result 102 states and 129 transitions. [2019-01-01 20:34:24,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 20:34:24,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-01-01 20:34:24,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:24,427 INFO L225 Difference]: With dead ends: 102 [2019-01-01 20:34:24,427 INFO L226 Difference]: Without dead ends: 101 [2019-01-01 20:34:24,428 INFO L631 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-01-01 20:34:24,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-01 20:34:24,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-01-01 20:34:24,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-01 20:34:24,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 126 transitions. [2019-01-01 20:34:24,437 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 126 transitions. Word has length 38 [2019-01-01 20:34:24,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:24,438 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 126 transitions. [2019-01-01 20:34:24,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 20:34:24,438 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 126 transitions. [2019-01-01 20:34:24,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-01 20:34:24,440 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:24,440 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-01-01 20:34:24,441 INFO L423 AbstractCegarLoop]: === Iteration 14 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:24,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:24,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1309524525, now seen corresponding path program 1 times [2019-01-01 20:34:24,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:24,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:24,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:24,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:24,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:24,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:24,561 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-01 20:34:24,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:24,562 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:34:24,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:24,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:24,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:24,665 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-01 20:34:24,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:24,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-01 20:34:24,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 20:34:24,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 20:34:24,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 20:34:24,692 INFO L87 Difference]: Start difference. First operand 101 states and 126 transitions. Second operand 6 states. [2019-01-01 20:34:25,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:25,107 INFO L93 Difference]: Finished difference Result 117 states and 148 transitions. [2019-01-01 20:34:25,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 20:34:25,109 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2019-01-01 20:34:25,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:25,110 INFO L225 Difference]: With dead ends: 117 [2019-01-01 20:34:25,110 INFO L226 Difference]: Without dead ends: 108 [2019-01-01 20:34:25,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-01 20:34:25,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-01-01 20:34:25,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 105. [2019-01-01 20:34:25,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-01 20:34:25,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 131 transitions. [2019-01-01 20:34:25,121 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 131 transitions. Word has length 36 [2019-01-01 20:34:25,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:25,122 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 131 transitions. [2019-01-01 20:34:25,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 20:34:25,122 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 131 transitions. [2019-01-01 20:34:25,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-01 20:34:25,124 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:25,124 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:25,125 INFO L423 AbstractCegarLoop]: === Iteration 15 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:25,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:25,126 INFO L82 PathProgramCache]: Analyzing trace with hash 479382046, now seen corresponding path program 1 times [2019-01-01 20:34:25,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:25,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:25,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:25,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:25,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:25,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:25,253 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-01-01 20:34:25,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:25,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 20:34:25,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 20:34:25,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 20:34:25,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 20:34:25,256 INFO L87 Difference]: Start difference. First operand 105 states and 131 transitions. Second operand 5 states. [2019-01-01 20:34:25,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:25,474 INFO L93 Difference]: Finished difference Result 105 states and 131 transitions. [2019-01-01 20:34:25,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 20:34:25,478 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-01-01 20:34:25,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:25,479 INFO L225 Difference]: With dead ends: 105 [2019-01-01 20:34:25,479 INFO L226 Difference]: Without dead ends: 104 [2019-01-01 20:34:25,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 20:34:25,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-01-01 20:34:25,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 93. [2019-01-01 20:34:25,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-01 20:34:25,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 114 transitions. [2019-01-01 20:34:25,492 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 114 transitions. Word has length 54 [2019-01-01 20:34:25,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:25,492 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 114 transitions. [2019-01-01 20:34:25,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 20:34:25,493 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 114 transitions. [2019-01-01 20:34:25,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-01 20:34:25,496 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:25,497 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-01-01 20:34:25,497 INFO L423 AbstractCegarLoop]: === Iteration 16 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:25,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:25,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1742772627, now seen corresponding path program 1 times [2019-01-01 20:34:25,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:25,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:25,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:25,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:25,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:25,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:25,662 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-01-01 20:34:25,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:25,662 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:34:25,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:25,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:25,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:26,012 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 40 proven. 27 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-01-01 20:34:26,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:26,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10] total 14 [2019-01-01 20:34:26,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-01 20:34:26,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-01 20:34:26,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-01-01 20:34:26,033 INFO L87 Difference]: Start difference. First operand 93 states and 114 transitions. Second operand 14 states. [2019-01-01 20:34:27,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:27,142 INFO L93 Difference]: Finished difference Result 139 states and 185 transitions. [2019-01-01 20:34:27,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-01 20:34:27,144 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 84 [2019-01-01 20:34:27,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:27,146 INFO L225 Difference]: With dead ends: 139 [2019-01-01 20:34:27,147 INFO L226 Difference]: Without dead ends: 124 [2019-01-01 20:34:27,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=126, Invalid=686, Unknown=0, NotChecked=0, Total=812 [2019-01-01 20:34:27,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-01-01 20:34:27,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 108. [2019-01-01 20:34:27,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-01 20:34:27,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 133 transitions. [2019-01-01 20:34:27,160 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 133 transitions. Word has length 84 [2019-01-01 20:34:27,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:27,160 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 133 transitions. [2019-01-01 20:34:27,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-01 20:34:27,160 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 133 transitions. [2019-01-01 20:34:27,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-01 20:34:27,162 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:27,162 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:27,162 INFO L423 AbstractCegarLoop]: === Iteration 17 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:27,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:27,163 INFO L82 PathProgramCache]: Analyzing trace with hash 2029433884, now seen corresponding path program 1 times [2019-01-01 20:34:27,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:27,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:27,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:27,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:27,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:27,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:27,270 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-01-01 20:34:27,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:27,271 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:34:27,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:27,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:27,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:27,324 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-01-01 20:34:27,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 20:34:27,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2019-01-01 20:34:27,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 20:34:27,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 20:34:27,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 20:34:27,354 INFO L87 Difference]: Start difference. First operand 108 states and 133 transitions. Second operand 6 states. [2019-01-01 20:34:27,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:27,475 INFO L93 Difference]: Finished difference Result 210 states and 259 transitions. [2019-01-01 20:34:27,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 20:34:27,476 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-01-01 20:34:27,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:27,478 INFO L225 Difference]: With dead ends: 210 [2019-01-01 20:34:27,479 INFO L226 Difference]: Without dead ends: 114 [2019-01-01 20:34:27,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-01 20:34:27,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-01-01 20:34:27,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2019-01-01 20:34:27,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-01 20:34:27,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 135 transitions. [2019-01-01 20:34:27,500 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 135 transitions. Word has length 67 [2019-01-01 20:34:27,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:27,502 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 135 transitions. [2019-01-01 20:34:27,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 20:34:27,502 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 135 transitions. [2019-01-01 20:34:27,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-01 20:34:27,507 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:27,508 INFO L402 BasicCegarLoop]: trace histogram [8, 6, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:27,509 INFO L423 AbstractCegarLoop]: === Iteration 18 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:27,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:27,510 INFO L82 PathProgramCache]: Analyzing trace with hash -2105175545, now seen corresponding path program 1 times [2019-01-01 20:34:27,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:27,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:27,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:27,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:27,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:27,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:27,863 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 26 proven. 13 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-01-01 20:34:27,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:27,864 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:34:27,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:27,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:27,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:27,936 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 26 proven. 13 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-01-01 20:34:27,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:27,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-01 20:34:27,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 20:34:27,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 20:34:27,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 20:34:27,957 INFO L87 Difference]: Start difference. First operand 112 states and 135 transitions. Second operand 6 states. [2019-01-01 20:34:28,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:28,217 INFO L93 Difference]: Finished difference Result 234 states and 307 transitions. [2019-01-01 20:34:28,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 20:34:28,222 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-01-01 20:34:28,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:28,225 INFO L225 Difference]: With dead ends: 234 [2019-01-01 20:34:28,225 INFO L226 Difference]: Without dead ends: 129 [2019-01-01 20:34:28,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-01-01 20:34:28,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-01-01 20:34:28,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 120. [2019-01-01 20:34:28,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-01-01 20:34:28,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 149 transitions. [2019-01-01 20:34:28,238 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 149 transitions. Word has length 61 [2019-01-01 20:34:28,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:28,240 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 149 transitions. [2019-01-01 20:34:28,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 20:34:28,240 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 149 transitions. [2019-01-01 20:34:28,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-01 20:34:28,243 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:28,243 INFO L402 BasicCegarLoop]: trace histogram [13, 12, 9, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:28,243 INFO L423 AbstractCegarLoop]: === Iteration 19 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:28,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:28,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1764991022, now seen corresponding path program 2 times [2019-01-01 20:34:28,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:28,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:28,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:28,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:28,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:28,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:28,339 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 19 proven. 86 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2019-01-01 20:34:28,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:28,339 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:34:28,350 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 20:34:28,404 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 20:34:28,404 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:34:28,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:28,440 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 207 proven. 15 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-01-01 20:34:28,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:28,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-01 20:34:28,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 20:34:28,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 20:34:28,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 20:34:28,478 INFO L87 Difference]: Start difference. First operand 120 states and 149 transitions. Second operand 6 states. [2019-01-01 20:34:28,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:28,830 INFO L93 Difference]: Finished difference Result 260 states and 345 transitions. [2019-01-01 20:34:28,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 20:34:28,833 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 104 [2019-01-01 20:34:28,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:28,835 INFO L225 Difference]: With dead ends: 260 [2019-01-01 20:34:28,835 INFO L226 Difference]: Without dead ends: 147 [2019-01-01 20:34:28,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-01-01 20:34:28,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-01-01 20:34:28,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 132. [2019-01-01 20:34:28,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-01-01 20:34:28,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 164 transitions. [2019-01-01 20:34:28,851 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 164 transitions. Word has length 104 [2019-01-01 20:34:28,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:28,851 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 164 transitions. [2019-01-01 20:34:28,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 20:34:28,852 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 164 transitions. [2019-01-01 20:34:28,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-01-01 20:34:28,856 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:28,856 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:28,857 INFO L423 AbstractCegarLoop]: === Iteration 20 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:28,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:28,858 INFO L82 PathProgramCache]: Analyzing trace with hash -122657526, now seen corresponding path program 2 times [2019-01-01 20:34:28,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:28,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:28,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:28,859 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:34:28,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:28,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:29,064 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 100 proven. 77 refuted. 0 times theorem prover too weak. 456 trivial. 0 not checked. [2019-01-01 20:34:29,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:29,064 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:34:29,081 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 20:34:29,133 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 20:34:29,133 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:34:29,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:29,482 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 284 proven. 2 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2019-01-01 20:34:29,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:29,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 13 [2019-01-01 20:34:29,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-01 20:34:29,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-01 20:34:29,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-01-01 20:34:29,509 INFO L87 Difference]: Start difference. First operand 132 states and 164 transitions. Second operand 13 states. [2019-01-01 20:34:30,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:30,045 INFO L93 Difference]: Finished difference Result 204 states and 252 transitions. [2019-01-01 20:34:30,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-01 20:34:30,045 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 139 [2019-01-01 20:34:30,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:30,046 INFO L225 Difference]: With dead ends: 204 [2019-01-01 20:34:30,046 INFO L226 Difference]: Without dead ends: 0 [2019-01-01 20:34:30,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2019-01-01 20:34:30,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-01 20:34:30,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-01 20:34:30,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-01 20:34:30,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 20:34:30,051 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 139 [2019-01-01 20:34:30,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:30,051 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 20:34:30,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-01 20:34:30,051 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-01 20:34:30,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-01 20:34:30,061 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-01 20:34:30,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:34:30,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:34:30,972 WARN L181 SmtUtils]: Spent 656.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-01-01 20:34:31,146 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 15 [2019-01-01 20:34:31,426 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 10 [2019-01-01 20:34:31,429 INFO L448 ceAbstractionStarter]: For program point rec1FINAL(lines 11 15) no Hoare annotation was computed. [2019-01-01 20:34:31,430 INFO L448 ceAbstractionStarter]: For program point rec1EXIT(lines 11 15) no Hoare annotation was computed. [2019-01-01 20:34:31,430 INFO L448 ceAbstractionStarter]: For program point rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-01-01 20:34:31,430 INFO L448 ceAbstractionStarter]: For program point rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-01-01 20:34:31,430 INFO L448 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2019-01-01 20:34:31,431 INFO L451 ceAbstractionStarter]: At program point rec1ENTRY(lines 11 15) the Hoare annotation is: true [2019-01-01 20:34:31,431 INFO L448 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. [2019-01-01 20:34:31,431 INFO L448 ceAbstractionStarter]: For program point rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-01-01 20:34:31,431 INFO L448 ceAbstractionStarter]: For program point L12(lines 12 13) no Hoare annotation was computed. [2019-01-01 20:34:31,431 INFO L444 ceAbstractionStarter]: At program point L14-2(line 14) the Hoare annotation is: (or (< 2147483647 |rec1_#in~i|) (and (<= rec1_~i |rec1_#in~i|) (<= 1 rec1_~i))) [2019-01-01 20:34:31,431 INFO L448 ceAbstractionStarter]: For program point L14-3(line 14) no Hoare annotation was computed. [2019-01-01 20:34:31,431 INFO L448 ceAbstractionStarter]: For program point L14-4(line 14) no Hoare annotation was computed. [2019-01-01 20:34:31,432 INFO L448 ceAbstractionStarter]: For program point rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-01-01 20:34:31,432 INFO L448 ceAbstractionStarter]: For program point L14-5(line 14) no Hoare annotation was computed. [2019-01-01 20:34:31,432 INFO L448 ceAbstractionStarter]: For program point rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-01-01 20:34:31,432 INFO L444 ceAbstractionStarter]: At program point L14-6(line 14) the Hoare annotation is: (or (and (<= 0 (+ |rec1_#t~ret0| 2147483647)) (<= rec1_~i |rec1_#in~i|) (<= |rec1_#t~ret0| 1) (<= 1 rec1_~i)) (< 2147483647 |rec1_#in~i|)) [2019-01-01 20:34:31,432 INFO L448 ceAbstractionStarter]: For program point rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-01-01 20:34:31,432 INFO L448 ceAbstractionStarter]: For program point L14-7(line 14) no Hoare annotation was computed. [2019-01-01 20:34:31,432 INFO L444 ceAbstractionStarter]: At program point L14-8(line 14) the Hoare annotation is: (or (< 2147483647 |rec1_#in~i|) (and (<= 0 (+ |rec1_#t~ret0| 2147483647)) (<= rec1_~i |rec1_#in~i|) (<= |rec1_#t~ret1| 0) (<= |rec1_#t~ret0| 1) (<= 1 rec1_~i))) [2019-01-01 20:34:31,437 INFO L448 ceAbstractionStarter]: For program point L14-9(line 14) no Hoare annotation was computed. [2019-01-01 20:34:31,437 INFO L448 ceAbstractionStarter]: For program point L14-10(line 14) no Hoare annotation was computed. [2019-01-01 20:34:31,437 INFO L448 ceAbstractionStarter]: For program point L14-11(line 14) no Hoare annotation was computed. [2019-01-01 20:34:31,438 INFO L448 ceAbstractionStarter]: For program point rec2FINAL(lines 17 21) no Hoare annotation was computed. [2019-01-01 20:34:31,438 INFO L448 ceAbstractionStarter]: For program point rec2EXIT(lines 17 21) no Hoare annotation was computed. [2019-01-01 20:34:31,438 INFO L448 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2019-01-01 20:34:31,438 INFO L448 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2019-01-01 20:34:31,438 INFO L448 ceAbstractionStarter]: For program point L18(lines 18 19) no Hoare annotation was computed. [2019-01-01 20:34:31,438 INFO L444 ceAbstractionStarter]: At program point L20-2(line 20) the Hoare annotation is: (or (and (<= rec2_~j |rec2_#in~j|) (<= 1 rec2_~j)) (< 2147483647 |rec2_#in~j|)) [2019-01-01 20:34:31,438 INFO L448 ceAbstractionStarter]: For program point rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-01-01 20:34:31,439 INFO L448 ceAbstractionStarter]: For program point L20-3(line 20) no Hoare annotation was computed. [2019-01-01 20:34:31,439 INFO L448 ceAbstractionStarter]: For program point rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-01-01 20:34:31,439 INFO L444 ceAbstractionStarter]: At program point L20-4(line 20) the Hoare annotation is: (let ((.cse0 (<= rec2_~j |rec2_#in~j|)) (.cse1 (<= 1 rec2_~j))) (or (and .cse0 .cse1 (<= |rec2_#t~ret3| 0)) (and (<= 2 |rec2_#in~j|) .cse0 (<= |rec2_#t~ret3| 1) .cse1) (< 2147483647 |rec2_#in~j|))) [2019-01-01 20:34:31,439 INFO L448 ceAbstractionStarter]: For program point L20-5(line 20) no Hoare annotation was computed. [2019-01-01 20:34:31,439 INFO L448 ceAbstractionStarter]: For program point L20-6(line 20) no Hoare annotation was computed. [2019-01-01 20:34:31,439 INFO L448 ceAbstractionStarter]: For program point rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-01-01 20:34:31,439 INFO L448 ceAbstractionStarter]: For program point L20-7(line 20) no Hoare annotation was computed. [2019-01-01 20:34:31,440 INFO L448 ceAbstractionStarter]: For program point rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-01-01 20:34:31,445 INFO L451 ceAbstractionStarter]: At program point rec2ENTRY(lines 17 21) the Hoare annotation is: true [2019-01-01 20:34:31,445 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-01 20:34:31,445 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-01 20:34:31,445 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-01 20:34:31,446 INFO L444 ceAbstractionStarter]: At program point L25(line 25) the Hoare annotation is: (<= ULTIMATE.start_main_~x~0 2147483647) [2019-01-01 20:34:31,446 INFO L448 ceAbstractionStarter]: For program point L25-1(line 25) no Hoare annotation was computed. [2019-01-01 20:34:31,446 INFO L448 ceAbstractionStarter]: For program point L23(lines 23 26) no Hoare annotation was computed. [2019-01-01 20:34:31,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 08:34:31 BoogieIcfgContainer [2019-01-01 20:34:31,453 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 20:34:31,453 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 20:34:31,454 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 20:34:31,454 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 20:34:31,454 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 08:34:21" (3/4) ... [2019-01-01 20:34:31,461 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-01 20:34:31,469 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure rec1 [2019-01-01 20:34:31,470 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure rec2 [2019-01-01 20:34:31,480 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-01 20:34:31,480 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-01 20:34:31,534 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 20:34:31,534 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 20:34:31,535 INFO L168 Benchmark]: Toolchain (without parser) took 11478.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 203.9 MB). Free memory was 952.7 MB in the beginning and 808.7 MB in the end (delta: 144.0 MB). Peak memory consumption was 348.0 MB. Max. memory is 11.5 GB. [2019-01-01 20:34:31,537 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 20:34:31,537 INFO L168 Benchmark]: CACSL2BoogieTranslator took 311.00 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 20:34:31,538 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.90 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 20:34:31,538 INFO L168 Benchmark]: Boogie Preprocessor took 26.70 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 20:34:31,540 INFO L168 Benchmark]: RCFGBuilder took 756.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -172.1 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-01-01 20:34:31,541 INFO L168 Benchmark]: TraceAbstraction took 10250.34 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 65.5 MB). Free memory was 1.1 GB in the beginning and 808.7 MB in the end (delta: 305.4 MB). Peak memory consumption was 370.9 MB. Max. memory is 11.5 GB. [2019-01-01 20:34:31,542 INFO L168 Benchmark]: Witness Printer took 81.09 ms. Allocated memory is still 1.2 GB. Free memory is still 808.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 20:34:31,547 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 311.00 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.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 46.90 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.70 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 756.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -172.1 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10250.34 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 65.5 MB). Free memory was 1.1 GB in the beginning and 808.7 MB in the end (delta: 305.4 MB). Peak memory consumption was 370.9 MB. Max. memory is 11.5 GB. * Witness Printer took 81.09 ms. Allocated memory is still 1.2 GB. Free memory is still 808.7 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. SAFE Result, 10.1s OverallTime, 20 OverallIterations, 17 TraceHistogramMax, 4.9s AutomataDifference, 0.0s DeadEndRemovalTime, 1.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 736 SDtfs, 361 SDslu, 1662 SDs, 0 SdLazy, 1144 SolverSat, 117 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 620 GetRequests, 510 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=132occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 20 MinimizatonAttempts, 99 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 303 PreInvPairs, 328 NumberOfFragments, 100 HoareAnnotationTreeSize, 303 FomulaSimplifications, 736 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 8 FomulaSimplificationsInter, 325 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1293 NumberOfCodeBlocks, 1293 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1267 ConstructedInterpolants, 0 QuantifiedInterpolants, 140535 SizeOfPredicates, 12 NumberOfNonLiveVariables, 1013 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 26 InterpolantComputations, 15 PerfectInterpolantSequences, 2613/2894 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...