./Ultimate.py --spec /storage/repos/svcomp/c/properties/no-overflow.prp --file /storage/repos/svcomp/c/termination-crafted/NestedRecursion_1c_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_1c_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 1b5ce1e17bce3e34a2c882b1080bdbc1a62cb801 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:20,936 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 20:34:20,941 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 20:34:20,956 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 20:34:20,957 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 20:34:20,958 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 20:34:20,960 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 20:34:20,961 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 20:34:20,963 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 20:34:20,964 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 20:34:20,965 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 20:34:20,965 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 20:34:20,967 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 20:34:20,968 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 20:34:20,969 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 20:34:20,969 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 20:34:20,971 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 20:34:20,973 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 20:34:20,975 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 20:34:20,977 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 20:34:20,978 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 20:34:20,980 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 20:34:20,982 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 20:34:20,983 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 20:34:20,983 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 20:34:20,984 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 20:34:20,985 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 20:34:20,986 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 20:34:20,987 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 20:34:20,988 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 20:34:20,989 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 20:34:20,989 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 20:34:20,989 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 20:34:20,990 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 20:34:20,991 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 20:34:20,992 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 20:34:20,992 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:21,020 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 20:34:21,020 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 20:34:21,021 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 20:34:21,021 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 20:34:21,024 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 20:34:21,024 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 20:34:21,024 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 20:34:21,024 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 20:34:21,024 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 20:34:21,025 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-01 20:34:21,025 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 20:34:21,025 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-01 20:34:21,025 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2019-01-01 20:34:21,025 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 20:34:21,026 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 20:34:21,026 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-01 20:34:21,026 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 20:34:21,026 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 20:34:21,026 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 20:34:21,026 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 20:34:21,029 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 20:34:21,029 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 20:34:21,029 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 20:34:21,029 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-01 20:34:21,029 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 20:34:21,029 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 20:34:21,030 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-01 20:34:21,031 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 -> 1b5ce1e17bce3e34a2c882b1080bdbc1a62cb801 [2019-01-01 20:34:21,094 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 20:34:21,111 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 20:34:21,119 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 20:34:21,121 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 20:34:21,121 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 20:34:21,123 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted/NestedRecursion_1c_true-no-overflow_true-termination_true-valid-memsafety.c [2019-01-01 20:34:21,189 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/028f3c3cc/765bde4c6ce847cf96927572968a6f07/FLAGebf983f69 [2019-01-01 20:34:21,689 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 20:34:21,690 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted/NestedRecursion_1c_true-no-overflow_true-termination_true-valid-memsafety.c [2019-01-01 20:34:21,695 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/028f3c3cc/765bde4c6ce847cf96927572968a6f07/FLAGebf983f69 [2019-01-01 20:34:22,045 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/028f3c3cc/765bde4c6ce847cf96927572968a6f07 [2019-01-01 20:34:22,050 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 20:34:22,051 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 20:34:22,052 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 20:34:22,052 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 20:34:22,056 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 20:34:22,057 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 08:34:22" (1/1) ... [2019-01-01 20:34:22,061 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@814bf51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:22, skipping insertion in model container [2019-01-01 20:34:22,061 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 08:34:22" (1/1) ... [2019-01-01 20:34:22,070 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 20:34:22,087 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 20:34:22,252 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 20:34:22,257 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 20:34:22,276 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 20:34:22,293 INFO L195 MainTranslator]: Completed translation [2019-01-01 20:34:22,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:22 WrapperNode [2019-01-01 20:34:22,293 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 20:34:22,295 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 20:34:22,295 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 20:34:22,295 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 20:34:22,306 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:22" (1/1) ... [2019-01-01 20:34:22,312 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:22" (1/1) ... [2019-01-01 20:34:22,332 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 20:34:22,332 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 20:34:22,332 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 20:34:22,332 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 20:34:22,344 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:22" (1/1) ... [2019-01-01 20:34:22,344 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:22" (1/1) ... [2019-01-01 20:34:22,345 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:22" (1/1) ... [2019-01-01 20:34:22,345 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:22" (1/1) ... [2019-01-01 20:34:22,349 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:22" (1/1) ... [2019-01-01 20:34:22,351 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:22" (1/1) ... [2019-01-01 20:34:22,353 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:22" (1/1) ... [2019-01-01 20:34:22,354 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 20:34:22,355 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 20:34:22,355 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 20:34:22,355 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 20:34:22,356 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:22" (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:22,491 INFO L130 BoogieDeclarations]: Found specification of procedure rec1 [2019-01-01 20:34:22,492 INFO L138 BoogieDeclarations]: Found implementation of procedure rec1 [2019-01-01 20:34:22,492 INFO L130 BoogieDeclarations]: Found specification of procedure rec2 [2019-01-01 20:34:22,492 INFO L138 BoogieDeclarations]: Found implementation of procedure rec2 [2019-01-01 20:34:22,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 20:34:22,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 20:34:22,998 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 20:34:22,999 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-01 20:34:23,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 08:34:22 BoogieIcfgContainer [2019-01-01 20:34:23,000 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 20:34:23,001 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 20:34:23,006 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 20:34:23,009 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 20:34:23,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 08:34:22" (1/3) ... [2019-01-01 20:34:23,010 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3be75d5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 08:34:23, skipping insertion in model container [2019-01-01 20:34:23,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:22" (2/3) ... [2019-01-01 20:34:23,011 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3be75d5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 08:34:23, skipping insertion in model container [2019-01-01 20:34:23,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 08:34:22" (3/3) ... [2019-01-01 20:34:23,014 INFO L112 eAbstractionObserver]: Analyzing ICFG NestedRecursion_1c_true-no-overflow_true-termination_true-valid-memsafety.c [2019-01-01 20:34:23,027 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 20:34:23,036 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2019-01-01 20:34:23,052 INFO L257 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2019-01-01 20:34:23,093 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 20:34:23,094 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 20:34:23,094 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-01 20:34:23,094 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 20:34:23,095 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 20:34:23,095 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 20:34:23,095 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 20:34:23,095 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 20:34:23,096 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 20:34:23,120 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2019-01-01 20:34:23,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-01 20:34:23,126 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:23,127 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-01 20:34:23,130 INFO L423 AbstractCegarLoop]: === Iteration 1 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:23,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:23,136 INFO L82 PathProgramCache]: Analyzing trace with hash 70122184, now seen corresponding path program 1 times [2019-01-01 20:34:23,139 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:23,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:23,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:23,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:23,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:23,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:23,344 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:23,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:23,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 20:34:23,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 20:34:23,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 20:34:23,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 20:34:23,367 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 5 states. [2019-01-01 20:34:23,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:23,492 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2019-01-01 20:34:23,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 20:34:23,494 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-01-01 20:34:23,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:23,504 INFO L225 Difference]: With dead ends: 44 [2019-01-01 20:34:23,504 INFO L226 Difference]: Without dead ends: 39 [2019-01-01 20:34:23,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 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:23,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-01 20:34:23,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-01-01 20:34:23,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-01 20:34:23,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2019-01-01 20:34:23,553 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 5 [2019-01-01 20:34:23,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:23,553 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2019-01-01 20:34:23,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 20:34:23,554 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2019-01-01 20:34:23,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-01 20:34:23,554 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:23,554 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-01 20:34:23,555 INFO L423 AbstractCegarLoop]: === Iteration 2 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:23,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:23,555 INFO L82 PathProgramCache]: Analyzing trace with hash -2121179530, now seen corresponding path program 1 times [2019-01-01 20:34:23,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:23,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:23,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:23,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:23,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:23,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:23,616 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:23,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:23,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 20:34:23,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 20:34:23,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 20:34:23,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 20:34:23,620 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 3 states. [2019-01-01 20:34:23,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:23,655 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2019-01-01 20:34:23,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 20:34:23,656 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-01-01 20:34:23,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:23,659 INFO L225 Difference]: With dead ends: 41 [2019-01-01 20:34:23,659 INFO L226 Difference]: Without dead ends: 40 [2019-01-01 20:34:23,660 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,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-01 20:34:23,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2019-01-01 20:34:23,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-01 20:34:23,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2019-01-01 20:34:23,670 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 6 [2019-01-01 20:34:23,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:23,671 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2019-01-01 20:34:23,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 20:34:23,671 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2019-01-01 20:34:23,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-01 20:34:23,672 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:23,672 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:23,673 INFO L423 AbstractCegarLoop]: === Iteration 3 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:23,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:23,673 INFO L82 PathProgramCache]: Analyzing trace with hash -509849608, now seen corresponding path program 1 times [2019-01-01 20:34:23,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:23,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:23,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:23,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:23,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:23,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:23,750 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,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:23,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 20:34:23,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 20:34:23,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 20:34:23,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 20:34:23,752 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand 5 states. [2019-01-01 20:34:24,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:24,168 INFO L93 Difference]: Finished difference Result 62 states and 74 transitions. [2019-01-01 20:34:24,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 20:34:24,169 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-01-01 20:34:24,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:24,171 INFO L225 Difference]: With dead ends: 62 [2019-01-01 20:34:24,171 INFO L226 Difference]: Without dead ends: 61 [2019-01-01 20:34:24,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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:24,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-01 20:34:24,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 54. [2019-01-01 20:34:24,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-01-01 20:34:24,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 67 transitions. [2019-01-01 20:34:24,188 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 67 transitions. Word has length 16 [2019-01-01 20:34:24,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:24,189 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 67 transitions. [2019-01-01 20:34:24,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 20:34:24,189 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 67 transitions. [2019-01-01 20:34:24,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-01 20:34:24,190 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:24,190 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:24,191 INFO L423 AbstractCegarLoop]: === Iteration 4 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:24,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:24,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1374531374, now seen corresponding path program 1 times [2019-01-01 20:34:24,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:24,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:24,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:24,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:24,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:24,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:24,244 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:24,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:24,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 20:34:24,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 20:34:24,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 20:34:24,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 20:34:24,247 INFO L87 Difference]: Start difference. First operand 54 states and 67 transitions. Second operand 3 states. [2019-01-01 20:34:24,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:24,268 INFO L93 Difference]: Finished difference Result 58 states and 76 transitions. [2019-01-01 20:34:24,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 20:34:24,268 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-01-01 20:34:24,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:24,270 INFO L225 Difference]: With dead ends: 58 [2019-01-01 20:34:24,270 INFO L226 Difference]: Without dead ends: 57 [2019-01-01 20:34:24,271 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,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-01 20:34:24,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2019-01-01 20:34:24,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-01 20:34:24,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 65 transitions. [2019-01-01 20:34:24,283 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 65 transitions. Word has length 17 [2019-01-01 20:34:24,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:24,283 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 65 transitions. [2019-01-01 20:34:24,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 20:34:24,284 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 65 transitions. [2019-01-01 20:34:24,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-01 20:34:24,285 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:24,285 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:24,285 INFO L423 AbstractCegarLoop]: === Iteration 5 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:24,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:24,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1925643664, now seen corresponding path program 1 times [2019-01-01 20:34:24,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:24,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:24,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:24,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:24,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:24,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:24,339 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:24,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:24,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 20:34:24,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 20:34:24,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 20:34:24,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 20:34:24,341 INFO L87 Difference]: Start difference. First operand 53 states and 65 transitions. Second operand 3 states. [2019-01-01 20:34:24,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:24,376 INFO L93 Difference]: Finished difference Result 53 states and 65 transitions. [2019-01-01 20:34:24,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 20:34:24,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-01-01 20:34:24,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:24,377 INFO L225 Difference]: With dead ends: 53 [2019-01-01 20:34:24,377 INFO L226 Difference]: Without dead ends: 52 [2019-01-01 20:34:24,378 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,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-01 20:34:24,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-01-01 20:34:24,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-01 20:34:24,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 64 transitions. [2019-01-01 20:34:24,387 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 64 transitions. Word has length 19 [2019-01-01 20:34:24,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:24,388 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 64 transitions. [2019-01-01 20:34:24,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 20:34:24,388 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 64 transitions. [2019-01-01 20:34:24,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-01 20:34:24,389 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:24,389 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:24,390 INFO L423 AbstractCegarLoop]: === Iteration 6 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:24,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:24,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1379292549, now seen corresponding path program 1 times [2019-01-01 20:34:24,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:24,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:24,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:24,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:24,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:24,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:24,490 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-01 20:34:24,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:24,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 20:34:24,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 20:34:24,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 20:34:24,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 20:34:24,492 INFO L87 Difference]: Start difference. First operand 52 states and 64 transitions. Second operand 4 states. [2019-01-01 20:34:24,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:24,520 INFO L93 Difference]: Finished difference Result 60 states and 77 transitions. [2019-01-01 20:34:24,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 20:34:24,521 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-01-01 20:34:24,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:24,523 INFO L225 Difference]: With dead ends: 60 [2019-01-01 20:34:24,523 INFO L226 Difference]: Without dead ends: 59 [2019-01-01 20:34:24,523 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,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-01 20:34:24,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2019-01-01 20:34:24,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-01 20:34:24,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 70 transitions. [2019-01-01 20:34:24,534 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 70 transitions. Word has length 25 [2019-01-01 20:34:24,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:24,535 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 70 transitions. [2019-01-01 20:34:24,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 20:34:24,535 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2019-01-01 20:34:24,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-01 20:34:24,536 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:24,536 INFO L402 BasicCegarLoop]: trace histogram [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,537 INFO L423 AbstractCegarLoop]: === Iteration 7 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:24,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:24,537 INFO L82 PathProgramCache]: Analyzing trace with hash 968719713, now seen corresponding path program 1 times [2019-01-01 20:34:24,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:24,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:24,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:24,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:24,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:24,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:24,571 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 20:34:24,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:24,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 20:34:24,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 20:34:24,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 20:34:24,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 20:34:24,573 INFO L87 Difference]: Start difference. First operand 57 states and 70 transitions. Second operand 3 states. [2019-01-01 20:34:24,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:24,592 INFO L93 Difference]: Finished difference Result 57 states and 70 transitions. [2019-01-01 20:34:24,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 20:34:24,593 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-01-01 20:34:24,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:24,595 INFO L225 Difference]: With dead ends: 57 [2019-01-01 20:34:24,595 INFO L226 Difference]: Without dead ends: 56 [2019-01-01 20:34:24,596 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,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-01 20:34:24,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-01-01 20:34:24,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-01 20:34:24,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2019-01-01 20:34:24,606 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 24 [2019-01-01 20:34:24,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:24,606 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 68 transitions. [2019-01-01 20:34:24,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 20:34:24,608 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2019-01-01 20:34:24,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-01 20:34:24,609 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:24,610 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 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,610 INFO L423 AbstractCegarLoop]: === Iteration 8 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:24,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:24,611 INFO L82 PathProgramCache]: Analyzing trace with hash -34459925, now seen corresponding path program 1 times [2019-01-01 20:34:24,611 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:24,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:24,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:24,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:24,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:24,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:24,651 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 20:34:24,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:24,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 20:34:24,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 20:34:24,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 20:34:24,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 20:34:24,654 INFO L87 Difference]: Start difference. First operand 56 states and 68 transitions. Second operand 4 states. [2019-01-01 20:34:24,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:24,798 INFO L93 Difference]: Finished difference Result 79 states and 106 transitions. [2019-01-01 20:34:24,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 20:34:24,800 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-01-01 20:34:24,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:24,802 INFO L225 Difference]: With dead ends: 79 [2019-01-01 20:34:24,802 INFO L226 Difference]: Without dead ends: 78 [2019-01-01 20:34:24,805 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,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-01-01 20:34:24,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 64. [2019-01-01 20:34:24,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-01 20:34:24,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 80 transitions. [2019-01-01 20:34:24,831 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 80 transitions. Word has length 25 [2019-01-01 20:34:24,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:24,831 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 80 transitions. [2019-01-01 20:34:24,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 20:34:24,832 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 80 transitions. [2019-01-01 20:34:24,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-01 20:34:24,833 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:24,833 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:24,837 INFO L423 AbstractCegarLoop]: === Iteration 9 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:24,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:24,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1245710426, now seen corresponding path program 1 times [2019-01-01 20:34:24,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:24,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:24,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:24,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:24,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:24,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:24,908 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 20:34:24,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:24,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 20:34:24,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 20:34:24,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 20:34:24,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 20:34:24,909 INFO L87 Difference]: Start difference. First operand 64 states and 80 transitions. Second operand 5 states. [2019-01-01 20:34:25,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:25,080 INFO L93 Difference]: Finished difference Result 89 states and 110 transitions. [2019-01-01 20:34:25,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 20:34:25,081 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-01-01 20:34:25,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:25,083 INFO L225 Difference]: With dead ends: 89 [2019-01-01 20:34:25,084 INFO L226 Difference]: Without dead ends: 88 [2019-01-01 20:34:25,085 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:25,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-01-01 20:34:25,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 85. [2019-01-01 20:34:25,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-01-01 20:34:25,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 109 transitions. [2019-01-01 20:34:25,099 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 109 transitions. Word has length 29 [2019-01-01 20:34:25,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:25,100 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 109 transitions. [2019-01-01 20:34:25,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 20:34:25,100 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 109 transitions. [2019-01-01 20:34:25,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-01 20:34:25,102 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:25,102 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:25,103 INFO L423 AbstractCegarLoop]: === Iteration 10 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:25,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:25,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1397852850, now seen corresponding path program 1 times [2019-01-01 20:34:25,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:25,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:25,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:25,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:25,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:25,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:25,270 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-01-01 20:34:25,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:25,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 20:34:25,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 20:34:25,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 20:34:25,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 20:34:25,272 INFO L87 Difference]: Start difference. First operand 85 states and 109 transitions. Second operand 5 states. [2019-01-01 20:34:25,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:25,728 INFO L93 Difference]: Finished difference Result 88 states and 109 transitions. [2019-01-01 20:34:25,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 20:34:25,729 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-01-01 20:34:25,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:25,730 INFO L225 Difference]: With dead ends: 88 [2019-01-01 20:34:25,731 INFO L226 Difference]: Without dead ends: 87 [2019-01-01 20:34:25,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-01 20:34:25,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-01-01 20:34:25,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2019-01-01 20:34:25,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-01 20:34:25,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 108 transitions. [2019-01-01 20:34:25,744 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 108 transitions. Word has length 40 [2019-01-01 20:34:25,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:25,744 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 108 transitions. [2019-01-01 20:34:25,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 20:34:25,745 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 108 transitions. [2019-01-01 20:34:25,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-01 20:34:25,746 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:25,746 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:25,747 INFO L423 AbstractCegarLoop]: === Iteration 11 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:25,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:25,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1824971537, now seen corresponding path program 1 times [2019-01-01 20:34:25,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:25,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:25,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:25,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:25,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:25,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:25,799 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-01-01 20:34:25,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:25,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 20:34:25,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 20:34:25,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 20:34:25,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 20:34:25,802 INFO L87 Difference]: Start difference. First operand 84 states and 108 transitions. Second operand 4 states. [2019-01-01 20:34:25,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:25,853 INFO L93 Difference]: Finished difference Result 94 states and 123 transitions. [2019-01-01 20:34:25,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 20:34:25,854 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2019-01-01 20:34:25,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:25,856 INFO L225 Difference]: With dead ends: 94 [2019-01-01 20:34:25,856 INFO L226 Difference]: Without dead ends: 93 [2019-01-01 20:34:25,857 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:25,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-01 20:34:25,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 90. [2019-01-01 20:34:25,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-01-01 20:34:25,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 114 transitions. [2019-01-01 20:34:25,868 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 114 transitions. Word has length 38 [2019-01-01 20:34:25,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:25,868 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 114 transitions. [2019-01-01 20:34:25,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 20:34:25,868 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 114 transitions. [2019-01-01 20:34:25,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-01 20:34:25,870 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:25,870 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:25,871 INFO L423 AbstractCegarLoop]: === Iteration 12 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:25,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:25,871 INFO L82 PathProgramCache]: Analyzing trace with hash 437829342, now seen corresponding path program 1 times [2019-01-01 20:34:25,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:25,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:25,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:25,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:25,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:25,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:25,935 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-01-01 20:34:25,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:25,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 20:34:25,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 20:34:25,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 20:34:25,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 20:34:25,937 INFO L87 Difference]: Start difference. First operand 90 states and 114 transitions. Second operand 3 states. [2019-01-01 20:34:25,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:25,951 INFO L93 Difference]: Finished difference Result 90 states and 114 transitions. [2019-01-01 20:34:25,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 20:34:25,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-01-01 20:34:25,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:25,954 INFO L225 Difference]: With dead ends: 90 [2019-01-01 20:34:25,954 INFO L226 Difference]: Without dead ends: 89 [2019-01-01 20:34:25,954 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:25,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-01 20:34:25,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-01-01 20:34:25,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-01-01 20:34:25,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 111 transitions. [2019-01-01 20:34:25,964 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 111 transitions. Word has length 44 [2019-01-01 20:34:25,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:25,965 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 111 transitions. [2019-01-01 20:34:25,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 20:34:25,965 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 111 transitions. [2019-01-01 20:34:25,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-01 20:34:25,967 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:25,968 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:25,968 INFO L423 AbstractCegarLoop]: === Iteration 13 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:25,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:25,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1365769909, now seen corresponding path program 1 times [2019-01-01 20:34:25,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:25,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:25,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:25,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:25,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:25,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:26,051 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-01-01 20:34:26,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:26,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 20:34:26,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 20:34:26,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 20:34:26,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 20:34:26,053 INFO L87 Difference]: Start difference. First operand 89 states and 111 transitions. Second operand 5 states. [2019-01-01 20:34:26,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:26,246 INFO L93 Difference]: Finished difference Result 89 states and 111 transitions. [2019-01-01 20:34:26,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 20:34:26,247 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-01-01 20:34:26,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:26,248 INFO L225 Difference]: With dead ends: 89 [2019-01-01 20:34:26,248 INFO L226 Difference]: Without dead ends: 88 [2019-01-01 20:34:26,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 20:34:26,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-01-01 20:34:26,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 85. [2019-01-01 20:34:26,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-01-01 20:34:26,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 107 transitions. [2019-01-01 20:34:26,268 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 107 transitions. Word has length 49 [2019-01-01 20:34:26,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:26,269 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 107 transitions. [2019-01-01 20:34:26,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 20:34:26,269 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 107 transitions. [2019-01-01 20:34:26,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-01 20:34:26,278 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:26,278 INFO L402 BasicCegarLoop]: trace histogram [6, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:26,278 INFO L423 AbstractCegarLoop]: === Iteration 14 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:26,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:26,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1695423190, now seen corresponding path program 1 times [2019-01-01 20:34:26,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:26,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:26,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:26,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:26,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:26,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:26,433 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-01-01 20:34:26,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:26,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 20:34:26,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 20:34:26,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 20:34:26,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 20:34:26,435 INFO L87 Difference]: Start difference. First operand 85 states and 107 transitions. Second operand 5 states. [2019-01-01 20:34:26,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:26,493 INFO L93 Difference]: Finished difference Result 85 states and 107 transitions. [2019-01-01 20:34:26,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 20:34:26,494 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-01-01 20:34:26,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:26,496 INFO L225 Difference]: With dead ends: 85 [2019-01-01 20:34:26,496 INFO L226 Difference]: Without dead ends: 84 [2019-01-01 20:34:26,496 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:26,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-01-01 20:34:26,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 71. [2019-01-01 20:34:26,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-01 20:34:26,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 87 transitions. [2019-01-01 20:34:26,504 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 87 transitions. Word has length 54 [2019-01-01 20:34:26,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:26,505 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 87 transitions. [2019-01-01 20:34:26,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 20:34:26,505 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 87 transitions. [2019-01-01 20:34:26,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-01 20:34:26,507 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:26,507 INFO L402 BasicCegarLoop]: trace histogram [8, 6, 5, 3, 3, 3, 3, 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] [2019-01-01 20:34:26,508 INFO L423 AbstractCegarLoop]: === Iteration 15 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:26,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:26,508 INFO L82 PathProgramCache]: Analyzing trace with hash -2019496816, now seen corresponding path program 1 times [2019-01-01 20:34:26,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:26,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:26,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:26,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:26,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:26,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:26,616 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 4 proven. 36 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-01-01 20:34:26,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:26,616 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:26,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:26,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:26,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:26,713 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-01-01 20:34:26,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 20:34:26,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2019-01-01 20:34:26,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 20:34:26,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 20:34:26,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 20:34:26,744 INFO L87 Difference]: Start difference. First operand 71 states and 87 transitions. Second operand 6 states. [2019-01-01 20:34:26,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:26,866 INFO L93 Difference]: Finished difference Result 150 states and 187 transitions. [2019-01-01 20:34:26,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 20:34:26,868 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-01-01 20:34:26,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:26,869 INFO L225 Difference]: With dead ends: 150 [2019-01-01 20:34:26,869 INFO L226 Difference]: Without dead ends: 86 [2019-01-01 20:34:26,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 68 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:26,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-01-01 20:34:26,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 79. [2019-01-01 20:34:26,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-01-01 20:34:26,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 95 transitions. [2019-01-01 20:34:26,883 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 95 transitions. Word has length 67 [2019-01-01 20:34:26,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:26,884 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 95 transitions. [2019-01-01 20:34:26,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 20:34:26,884 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2019-01-01 20:34:26,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-01-01 20:34:26,888 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:26,888 INFO L402 BasicCegarLoop]: trace histogram [9, 7, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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:26,889 INFO L423 AbstractCegarLoop]: === Iteration 16 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:26,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:26,889 INFO L82 PathProgramCache]: Analyzing trace with hash -589086428, now seen corresponding path program 1 times [2019-01-01 20:34:26,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:26,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:26,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:26,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:26,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:26,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:27,179 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 31 proven. 13 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-01-01 20:34:27,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:27,180 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:27,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:27,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:27,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:27,439 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-01-01 20:34:27,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 20:34:27,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [6] total 11 [2019-01-01 20:34:27,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-01 20:34:27,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-01 20:34:27,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-01-01 20:34:27,470 INFO L87 Difference]: Start difference. First operand 79 states and 95 transitions. Second operand 11 states. [2019-01-01 20:34:27,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:27,733 INFO L93 Difference]: Finished difference Result 93 states and 111 transitions. [2019-01-01 20:34:27,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 20:34:27,738 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 88 [2019-01-01 20:34:27,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:27,739 INFO L225 Difference]: With dead ends: 93 [2019-01-01 20:34:27,739 INFO L226 Difference]: Without dead ends: 0 [2019-01-01 20:34:27,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2019-01-01 20:34:27,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-01 20:34:27,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-01 20:34:27,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-01 20:34:27,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 20:34:27,742 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 88 [2019-01-01 20:34:27,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:27,743 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 20:34:27,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-01 20:34:27,743 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-01 20:34:27,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-01 20:34:27,748 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-01 20:34:27,958 INFO L448 ceAbstractionStarter]: For program point rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-01-01 20:34:27,958 INFO L448 ceAbstractionStarter]: For program point rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-01-01 20:34:27,958 INFO L448 ceAbstractionStarter]: For program point rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-01-01 20:34:27,958 INFO L448 ceAbstractionStarter]: For program point rec1FINAL(lines 11 15) no Hoare annotation was computed. [2019-01-01 20:34:27,958 INFO L448 ceAbstractionStarter]: For program point rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-01-01 20:34:27,958 INFO L448 ceAbstractionStarter]: For program point rec1EXIT(lines 11 15) no Hoare annotation was computed. [2019-01-01 20:34:27,959 INFO L448 ceAbstractionStarter]: For program point rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-01-01 20:34:27,959 INFO L448 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2019-01-01 20:34:27,959 INFO L451 ceAbstractionStarter]: At program point rec1ENTRY(lines 11 15) the Hoare annotation is: true [2019-01-01 20:34:27,959 INFO L448 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. [2019-01-01 20:34:27,959 INFO L448 ceAbstractionStarter]: For program point L12(lines 12 13) no Hoare annotation was computed. [2019-01-01 20:34:27,959 INFO L444 ceAbstractionStarter]: At program point L14-2(line 14) the Hoare annotation is: (< 0 |rec1_#in~i|) [2019-01-01 20:34:27,959 INFO L448 ceAbstractionStarter]: For program point L14-3(line 14) no Hoare annotation was computed. [2019-01-01 20:34:27,960 INFO L448 ceAbstractionStarter]: For program point L14-4(line 14) no Hoare annotation was computed. [2019-01-01 20:34:27,960 INFO L448 ceAbstractionStarter]: For program point L14-5(line 14) no Hoare annotation was computed. [2019-01-01 20:34:27,960 INFO L444 ceAbstractionStarter]: At program point L14-6(line 14) the Hoare annotation is: (< 0 |rec1_#in~i|) [2019-01-01 20:34:27,960 INFO L448 ceAbstractionStarter]: For program point L14-7(line 14) no Hoare annotation was computed. [2019-01-01 20:34:27,960 INFO L444 ceAbstractionStarter]: At program point L14-8(line 14) the Hoare annotation is: (< 0 |rec1_#in~i|) [2019-01-01 20:34:27,960 INFO L448 ceAbstractionStarter]: For program point L14-9(line 14) no Hoare annotation was computed. [2019-01-01 20:34:27,960 INFO L448 ceAbstractionStarter]: For program point L14-10(line 14) no Hoare annotation was computed. [2019-01-01 20:34:27,961 INFO L448 ceAbstractionStarter]: For program point rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-01-01 20:34:27,961 INFO L448 ceAbstractionStarter]: For program point L14-11(line 14) no Hoare annotation was computed. [2019-01-01 20:34:27,961 INFO L448 ceAbstractionStarter]: For program point rec2FINAL(lines 17 21) no Hoare annotation was computed. [2019-01-01 20:34:27,961 INFO L448 ceAbstractionStarter]: For program point rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-01-01 20:34:27,961 INFO L448 ceAbstractionStarter]: For program point rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-01-01 20:34:27,961 INFO L448 ceAbstractionStarter]: For program point rec2EXIT(lines 17 21) no Hoare annotation was computed. [2019-01-01 20:34:27,961 INFO L448 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2019-01-01 20:34:27,961 INFO L448 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2019-01-01 20:34:27,962 INFO L448 ceAbstractionStarter]: For program point L18(lines 18 19) no Hoare annotation was computed. [2019-01-01 20:34:27,962 INFO L444 ceAbstractionStarter]: At program point L20-2(line 20) the Hoare annotation is: (or (and (<= rec2_~j 2147483647) (<= 1 rec2_~j)) (< 2147483647 |rec2_#in~j|)) [2019-01-01 20:34:27,962 INFO L448 ceAbstractionStarter]: For program point L20-3(line 20) no Hoare annotation was computed. [2019-01-01 20:34:27,962 INFO L444 ceAbstractionStarter]: At program point L20-4(line 20) the Hoare annotation is: (or (and (<= rec2_~j 2147483647) (<= 1 rec2_~j) (<= |rec2_#t~ret3| 0)) (< 2147483647 |rec2_#in~j|)) [2019-01-01 20:34:27,962 INFO L448 ceAbstractionStarter]: For program point L20-5(line 20) no Hoare annotation was computed. [2019-01-01 20:34:27,962 INFO L448 ceAbstractionStarter]: For program point L20-6(line 20) no Hoare annotation was computed. [2019-01-01 20:34:27,962 INFO L448 ceAbstractionStarter]: For program point L20-7(line 20) no Hoare annotation was computed. [2019-01-01 20:34:27,963 INFO L451 ceAbstractionStarter]: At program point rec2ENTRY(lines 17 21) the Hoare annotation is: true [2019-01-01 20:34:27,963 INFO L448 ceAbstractionStarter]: For program point rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-01-01 20:34:27,963 INFO L448 ceAbstractionStarter]: For program point rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-01-01 20:34:27,963 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-01 20:34:27,963 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-01 20:34:27,963 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-01 20:34:27,963 INFO L444 ceAbstractionStarter]: At program point L25(line 25) the Hoare annotation is: (<= ULTIMATE.start_main_~x~0 2147483647) [2019-01-01 20:34:27,963 INFO L448 ceAbstractionStarter]: For program point L25-1(line 25) no Hoare annotation was computed. [2019-01-01 20:34:27,964 INFO L448 ceAbstractionStarter]: For program point L23(lines 23 26) no Hoare annotation was computed. [2019-01-01 20:34:27,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 08:34:27 BoogieIcfgContainer [2019-01-01 20:34:27,968 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 20:34:27,968 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 20:34:27,968 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 20:34:27,968 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 20:34:27,969 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:22" (3/4) ... [2019-01-01 20:34:27,973 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-01 20:34:27,980 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure rec1 [2019-01-01 20:34:27,980 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure rec2 [2019-01-01 20:34:27,985 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-01 20:34:27,986 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-01 20:34:28,040 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 20:34:28,041 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 20:34:28,042 INFO L168 Benchmark]: Toolchain (without parser) took 5991.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 952.7 MB in the beginning and 805.8 MB in the end (delta: 146.9 MB). Peak memory consumption was 268.5 MB. Max. memory is 11.5 GB. [2019-01-01 20:34:28,043 INFO L168 Benchmark]: CDTParser took 1.08 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:28,044 INFO L168 Benchmark]: CACSL2BoogieTranslator took 242.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:28,045 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.36 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:28,045 INFO L168 Benchmark]: Boogie Preprocessor took 22.20 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:28,045 INFO L168 Benchmark]: RCFGBuilder took 645.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -154.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-01-01 20:34:28,046 INFO L168 Benchmark]: TraceAbstraction took 4966.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 812.6 MB in the end (delta: 283.8 MB). Peak memory consumption was 283.8 MB. Max. memory is 11.5 GB. [2019-01-01 20:34:28,047 INFO L168 Benchmark]: Witness Printer took 72.63 ms. Allocated memory is still 1.2 GB. Free memory was 812.6 MB in the beginning and 805.8 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-01 20:34:28,051 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.08 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 242.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 37.36 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 22.20 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 645.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -154.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4966.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 812.6 MB in the end (delta: 283.8 MB). Peak memory consumption was 283.8 MB. Max. memory is 11.5 GB. * Witness Printer took 72.63 ms. Allocated memory is still 1.2 GB. Free memory was 812.6 MB in the beginning and 805.8 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. 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, 4.8s OverallTime, 16 OverallIterations, 9 TraceHistogramMax, 2.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 597 SDtfs, 200 SDslu, 1183 SDs, 0 SdLazy, 361 SolverSat, 48 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 222 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=11, 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, 16 MinimizatonAttempts, 61 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 95 PreInvPairs, 99 NumberOfFragments, 44 HoareAnnotationTreeSize, 95 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 78 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 701 NumberOfCodeBlocks, 701 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 683 ConstructedInterpolants, 0 QuantifiedInterpolants, 49775 SizeOfPredicates, 3 NumberOfNonLiveVariables, 321 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 18 InterpolantComputations, 16 PerfectInterpolantSequences, 674/723 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...