java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/bitvector/byte_add_1-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-09 05:36:07,132 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-09 05:36:07,136 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-09 05:36:07,156 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-09 05:36:07,157 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-09 05:36:07,159 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-09 05:36:07,161 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-09 05:36:07,173 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-09 05:36:07,177 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-09 05:36:07,180 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-09 05:36:07,183 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-09 05:36:07,185 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-09 05:36:07,186 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-09 05:36:07,188 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-09 05:36:07,190 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-09 05:36:07,192 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-09 05:36:07,193 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-09 05:36:07,195 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-09 05:36:07,197 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-09 05:36:07,203 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-09 05:36:07,207 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-09 05:36:07,210 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-09 05:36:07,213 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-09 05:36:07,214 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-09 05:36:07,216 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-09 05:36:07,216 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-09 05:36:07,216 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-09 05:36:07,218 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-09 05:36:07,220 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-09 05:36:07,221 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-09 05:36:07,221 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-09 05:36:07,223 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-09 05:36:07,223 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-09 05:36:07,224 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-09 05:36:07,226 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-09 05:36:07,227 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-09 05:36:07,227 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-09 05:36:07,228 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-09 05:36:07,228 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-09 05:36:07,229 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-09 05:36:07,229 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-09 05:36:07,231 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-09 05:36:07,272 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-09 05:36:07,274 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-09 05:36:07,275 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-09 05:36:07,275 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-09 05:36:07,276 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-09 05:36:07,276 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-09 05:36:07,276 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-09 05:36:07,276 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-09 05:36:07,277 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-09 05:36:07,277 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-09 05:36:07,278 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-09 05:36:07,278 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-09 05:36:07,279 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-09 05:36:07,279 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-09 05:36:07,279 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-09 05:36:07,280 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-09 05:36:07,280 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-09 05:36:07,280 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-09 05:36:07,280 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-09 05:36:07,281 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-09 05:36:07,281 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-09 05:36:07,281 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-09 05:36:07,281 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-09 05:36:07,282 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 05:36:07,282 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-09 05:36:07,282 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-09 05:36:07,282 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-09 05:36:07,282 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-09 05:36:07,283 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-09 05:36:07,283 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-09 05:36:07,335 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-09 05:36:07,354 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-09 05:36:07,361 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-09 05:36:07,363 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-09 05:36:07,364 INFO L275 PluginConnector]: CDTParser initialized [2019-09-09 05:36:07,365 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/byte_add_1-1.i [2019-09-09 05:36:07,450 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07703b996/6c08d3684143462fbb58912f143a9c34/FLAGabb40a1da [2019-09-09 05:36:07,920 INFO L306 CDTParser]: Found 1 translation units. [2019-09-09 05:36:07,921 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/byte_add_1-1.i [2019-09-09 05:36:07,943 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07703b996/6c08d3684143462fbb58912f143a9c34/FLAGabb40a1da [2019-09-09 05:36:08,260 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07703b996/6c08d3684143462fbb58912f143a9c34 [2019-09-09 05:36:08,274 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-09 05:36:08,276 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-09 05:36:08,281 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-09 05:36:08,282 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-09 05:36:08,286 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-09 05:36:08,287 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:36:08" (1/1) ... [2019-09-09 05:36:08,290 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52ed7882 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:36:08, skipping insertion in model container [2019-09-09 05:36:08,291 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:36:08" (1/1) ... [2019-09-09 05:36:08,299 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-09 05:36:08,335 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-09 05:36:08,675 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:36:08,680 INFO L188 MainTranslator]: Completed pre-run [2019-09-09 05:36:08,839 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:36:08,861 INFO L192 MainTranslator]: Completed translation [2019-09-09 05:36:08,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:36:08 WrapperNode [2019-09-09 05:36:08,862 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-09 05:36:08,863 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-09 05:36:08,863 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-09 05:36:08,864 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-09 05:36:08,877 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:36:08" (1/1) ... [2019-09-09 05:36:08,877 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:36:08" (1/1) ... [2019-09-09 05:36:08,886 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:36:08" (1/1) ... [2019-09-09 05:36:08,886 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:36:08" (1/1) ... [2019-09-09 05:36:08,901 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:36:08" (1/1) ... [2019-09-09 05:36:08,909 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:36:08" (1/1) ... [2019-09-09 05:36:08,911 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:36:08" (1/1) ... [2019-09-09 05:36:08,914 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-09 05:36:08,915 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-09 05:36:08,915 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-09 05:36:08,915 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-09 05:36:08,916 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:36:08" (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-09-09 05:36:08,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-09 05:36:08,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-09 05:36:08,983 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-09 05:36:08,983 INFO L138 BoogieDeclarations]: Found implementation of procedure mp_add [2019-09-09 05:36:08,983 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-09 05:36:08,983 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-09 05:36:08,984 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-09-09 05:36:08,984 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-09 05:36:08,984 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-09 05:36:08,984 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2019-09-09 05:36:08,984 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2019-09-09 05:36:08,984 INFO L130 BoogieDeclarations]: Found specification of procedure mp_add [2019-09-09 05:36:08,985 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-09 05:36:08,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-09 05:36:08,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-09 05:36:09,424 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-09 05:36:09,424 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-09 05:36:09,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:36:09 BoogieIcfgContainer [2019-09-09 05:36:09,426 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-09 05:36:09,427 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-09 05:36:09,427 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-09 05:36:09,430 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-09 05:36:09,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.09 05:36:08" (1/3) ... [2019-09-09 05:36:09,431 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9831a24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:36:09, skipping insertion in model container [2019-09-09 05:36:09,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:36:08" (2/3) ... [2019-09-09 05:36:09,432 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9831a24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:36:09, skipping insertion in model container [2019-09-09 05:36:09,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:36:09" (3/3) ... [2019-09-09 05:36:09,434 INFO L109 eAbstractionObserver]: Analyzing ICFG byte_add_1-1.i [2019-09-09 05:36:09,444 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-09 05:36:09,452 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-09 05:36:09,465 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-09 05:36:09,494 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-09 05:36:09,495 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-09 05:36:09,495 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-09 05:36:09,495 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-09 05:36:09,495 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-09 05:36:09,495 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-09 05:36:09,495 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-09 05:36:09,496 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-09 05:36:09,513 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2019-09-09 05:36:09,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-09 05:36:09,526 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:36:09,527 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:36:09,530 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:36:09,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:36:09,535 INFO L82 PathProgramCache]: Analyzing trace with hash 397916932, now seen corresponding path program 1 times [2019-09-09 05:36:09,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:36:09,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:36:09,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:36:09,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:36:09,583 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:36:09,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:36:09,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:36:09,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:36:09,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-09 05:36:09,675 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:36:09,681 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-09 05:36:09,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-09 05:36:09,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-09 05:36:09,697 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 2 states. [2019-09-09 05:36:09,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:36:09,719 INFO L93 Difference]: Finished difference Result 54 states and 80 transitions. [2019-09-09 05:36:09,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-09 05:36:09,720 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2019-09-09 05:36:09,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:36:09,730 INFO L225 Difference]: With dead ends: 54 [2019-09-09 05:36:09,730 INFO L226 Difference]: Without dead ends: 47 [2019-09-09 05:36:09,732 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-09 05:36:09,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-09-09 05:36:09,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-09-09 05:36:09,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-09 05:36:09,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 73 transitions. [2019-09-09 05:36:09,772 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 73 transitions. Word has length 21 [2019-09-09 05:36:09,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:36:09,772 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 73 transitions. [2019-09-09 05:36:09,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-09 05:36:09,773 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 73 transitions. [2019-09-09 05:36:09,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-09 05:36:09,774 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:36:09,774 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:36:09,775 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:36:09,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:36:09,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1531564698, now seen corresponding path program 1 times [2019-09-09 05:36:09,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:36:09,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:36:09,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:36:09,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:36:09,777 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:36:09,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:36:09,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:36:09,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:36:09,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:36:09,939 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:36:09,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:36:09,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:36:09,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:36:09,942 INFO L87 Difference]: Start difference. First operand 47 states and 73 transitions. Second operand 3 states. [2019-09-09 05:36:10,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:36:10,157 INFO L93 Difference]: Finished difference Result 70 states and 100 transitions. [2019-09-09 05:36:10,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:36:10,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-09 05:36:10,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:36:10,161 INFO L225 Difference]: With dead ends: 70 [2019-09-09 05:36:10,161 INFO L226 Difference]: Without dead ends: 70 [2019-09-09 05:36:10,162 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:36:10,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-09-09 05:36:10,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2019-09-09 05:36:10,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-09-09 05:36:10,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 98 transitions. [2019-09-09 05:36:10,173 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 98 transitions. Word has length 21 [2019-09-09 05:36:10,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:36:10,174 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 98 transitions. [2019-09-09 05:36:10,174 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:36:10,174 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 98 transitions. [2019-09-09 05:36:10,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-09 05:36:10,176 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:36:10,176 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:36:10,176 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:36:10,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:36:10,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1473767205, now seen corresponding path program 1 times [2019-09-09 05:36:10,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:36:10,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:36:10,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:36:10,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:36:10,179 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:36:10,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:36:10,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:36:10,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:36:10,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:36:10,322 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:36:10,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:36:10,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:36:10,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:36:10,326 INFO L87 Difference]: Start difference. First operand 68 states and 98 transitions. Second operand 4 states. [2019-09-09 05:36:10,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:36:10,716 INFO L93 Difference]: Finished difference Result 127 states and 173 transitions. [2019-09-09 05:36:10,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:36:10,718 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-09-09 05:36:10,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:36:10,722 INFO L225 Difference]: With dead ends: 127 [2019-09-09 05:36:10,722 INFO L226 Difference]: Without dead ends: 127 [2019-09-09 05:36:10,723 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:36:10,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-09-09 05:36:10,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 91. [2019-09-09 05:36:10,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-09-09 05:36:10,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 133 transitions. [2019-09-09 05:36:10,750 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 133 transitions. Word has length 27 [2019-09-09 05:36:10,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:36:10,751 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 133 transitions. [2019-09-09 05:36:10,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:36:10,751 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 133 transitions. [2019-09-09 05:36:10,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-09 05:36:10,753 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:36:10,754 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-09 05:36:10,754 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:36:10,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:36:10,755 INFO L82 PathProgramCache]: Analyzing trace with hash -13869364, now seen corresponding path program 1 times [2019-09-09 05:36:10,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:36:10,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:36:10,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:36:10,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:36:10,758 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:36:10,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:36:10,891 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-09 05:36:10,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:36:10,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:36:10,892 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:36:10,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:36:10,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:36:10,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:36:10,894 INFO L87 Difference]: Start difference. First operand 91 states and 133 transitions. Second operand 4 states. [2019-09-09 05:36:11,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:36:11,064 INFO L93 Difference]: Finished difference Result 162 states and 234 transitions. [2019-09-09 05:36:11,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:36:11,065 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-09-09 05:36:11,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:36:11,069 INFO L225 Difference]: With dead ends: 162 [2019-09-09 05:36:11,069 INFO L226 Difference]: Without dead ends: 158 [2019-09-09 05:36:11,070 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:36:11,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-09-09 05:36:11,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 148. [2019-09-09 05:36:11,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-09-09 05:36:11,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 219 transitions. [2019-09-09 05:36:11,088 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 219 transitions. Word has length 33 [2019-09-09 05:36:11,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:36:11,088 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 219 transitions. [2019-09-09 05:36:11,088 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:36:11,088 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 219 transitions. [2019-09-09 05:36:11,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-09 05:36:11,094 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:36:11,094 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-09 05:36:11,094 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:36:11,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:36:11,095 INFO L82 PathProgramCache]: Analyzing trace with hash -2027075515, now seen corresponding path program 1 times [2019-09-09 05:36:11,095 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:36:11,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:36:11,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:36:11,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:36:11,098 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:36:11,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:36:11,226 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-09 05:36:11,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:36:11,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:36:11,227 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:36:11,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:36:11,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:36:11,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:36:11,228 INFO L87 Difference]: Start difference. First operand 148 states and 219 transitions. Second operand 4 states. [2019-09-09 05:36:11,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:36:11,518 INFO L93 Difference]: Finished difference Result 312 states and 451 transitions. [2019-09-09 05:36:11,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:36:11,520 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-09-09 05:36:11,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:36:11,526 INFO L225 Difference]: With dead ends: 312 [2019-09-09 05:36:11,526 INFO L226 Difference]: Without dead ends: 311 [2019-09-09 05:36:11,527 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:36:11,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-09-09 05:36:11,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 212. [2019-09-09 05:36:11,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-09-09 05:36:11,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 324 transitions. [2019-09-09 05:36:11,568 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 324 transitions. Word has length 34 [2019-09-09 05:36:11,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:36:11,572 INFO L475 AbstractCegarLoop]: Abstraction has 212 states and 324 transitions. [2019-09-09 05:36:11,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:36:11,572 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 324 transitions. [2019-09-09 05:36:11,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-09 05:36:11,578 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:36:11,578 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:36:11,578 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:36:11,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:36:11,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1068918534, now seen corresponding path program 1 times [2019-09-09 05:36:11,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:36:11,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:36:11,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:36:11,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:36:11,582 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:36:11,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:36:11,708 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-09 05:36:11,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:36:11,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:36:11,709 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:36:11,710 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:36:11,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:36:11,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:36:11,711 INFO L87 Difference]: Start difference. First operand 212 states and 324 transitions. Second operand 4 states. [2019-09-09 05:36:11,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:36:11,996 INFO L93 Difference]: Finished difference Result 433 states and 654 transitions. [2019-09-09 05:36:11,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:36:11,997 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-09-09 05:36:11,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:36:12,000 INFO L225 Difference]: With dead ends: 433 [2019-09-09 05:36:12,000 INFO L226 Difference]: Without dead ends: 432 [2019-09-09 05:36:12,001 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:36:12,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-09-09 05:36:12,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 277. [2019-09-09 05:36:12,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-09-09 05:36:12,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 441 transitions. [2019-09-09 05:36:12,028 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 441 transitions. Word has length 40 [2019-09-09 05:36:12,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:36:12,029 INFO L475 AbstractCegarLoop]: Abstraction has 277 states and 441 transitions. [2019-09-09 05:36:12,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:36:12,029 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 441 transitions. [2019-09-09 05:36:12,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-09 05:36:12,034 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:36:12,034 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:36:12,035 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:36:12,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:36:12,039 INFO L82 PathProgramCache]: Analyzing trace with hash -213142741, now seen corresponding path program 1 times [2019-09-09 05:36:12,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:36:12,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:36:12,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:36:12,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:36:12,041 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:36:12,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:36:12,132 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-09 05:36:12,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:36:12,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:36:12,133 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:36:12,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:36:12,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:36:12,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:36:12,134 INFO L87 Difference]: Start difference. First operand 277 states and 441 transitions. Second operand 5 states. [2019-09-09 05:36:12,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:36:12,460 INFO L93 Difference]: Finished difference Result 564 states and 890 transitions. [2019-09-09 05:36:12,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:36:12,460 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-09-09 05:36:12,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:36:12,465 INFO L225 Difference]: With dead ends: 564 [2019-09-09 05:36:12,465 INFO L226 Difference]: Without dead ends: 564 [2019-09-09 05:36:12,466 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-09-09 05:36:12,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2019-09-09 05:36:12,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 287. [2019-09-09 05:36:12,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-09-09 05:36:12,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 454 transitions. [2019-09-09 05:36:12,486 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 454 transitions. Word has length 46 [2019-09-09 05:36:12,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:36:12,486 INFO L475 AbstractCegarLoop]: Abstraction has 287 states and 454 transitions. [2019-09-09 05:36:12,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:36:12,487 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 454 transitions. [2019-09-09 05:36:12,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-09 05:36:12,493 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:36:12,493 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:36:12,494 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:36:12,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:36:12,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1878612609, now seen corresponding path program 1 times [2019-09-09 05:36:12,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:36:12,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:36:12,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:36:12,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:36:12,496 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:36:12,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:36:12,611 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-09 05:36:12,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:36:12,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:36:12,612 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:36:12,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:36:12,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:36:12,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:36:12,613 INFO L87 Difference]: Start difference. First operand 287 states and 454 transitions. Second operand 5 states. [2019-09-09 05:36:12,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:36:12,666 INFO L93 Difference]: Finished difference Result 536 states and 858 transitions. [2019-09-09 05:36:12,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:36:12,667 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-09-09 05:36:12,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:36:12,669 INFO L225 Difference]: With dead ends: 536 [2019-09-09 05:36:12,669 INFO L226 Difference]: Without dead ends: 273 [2019-09-09 05:36:12,670 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-09-09 05:36:12,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-09-09 05:36:12,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2019-09-09 05:36:12,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-09-09 05:36:12,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 431 transitions. [2019-09-09 05:36:12,679 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 431 transitions. Word has length 47 [2019-09-09 05:36:12,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:36:12,679 INFO L475 AbstractCegarLoop]: Abstraction has 273 states and 431 transitions. [2019-09-09 05:36:12,680 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:36:12,680 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 431 transitions. [2019-09-09 05:36:12,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-09 05:36:12,681 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:36:12,681 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:36:12,681 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:36:12,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:36:12,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1858062597, now seen corresponding path program 1 times [2019-09-09 05:36:12,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:36:12,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:36:12,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:36:12,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:36:12,683 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:36:12,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:36:12,809 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-09 05:36:12,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:36:12,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:36:12,810 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:36:12,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:36:12,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:36:12,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:36:12,811 INFO L87 Difference]: Start difference. First operand 273 states and 431 transitions. Second operand 5 states. [2019-09-09 05:36:12,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:36:12,913 INFO L93 Difference]: Finished difference Result 363 states and 525 transitions. [2019-09-09 05:36:12,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:36:12,914 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-09-09 05:36:12,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:36:12,916 INFO L225 Difference]: With dead ends: 363 [2019-09-09 05:36:12,917 INFO L226 Difference]: Without dead ends: 348 [2019-09-09 05:36:12,917 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:36:12,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2019-09-09 05:36:12,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 292. [2019-09-09 05:36:12,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-09-09 05:36:12,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 443 transitions. [2019-09-09 05:36:12,927 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 443 transitions. Word has length 53 [2019-09-09 05:36:12,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:36:12,927 INFO L475 AbstractCegarLoop]: Abstraction has 292 states and 443 transitions. [2019-09-09 05:36:12,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:36:12,927 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 443 transitions. [2019-09-09 05:36:12,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-09 05:36:12,928 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:36:12,929 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:36:12,929 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:36:12,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:36:12,929 INFO L82 PathProgramCache]: Analyzing trace with hash -929516497, now seen corresponding path program 1 times [2019-09-09 05:36:12,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:36:12,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:36:12,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:36:12,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:36:12,931 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:36:12,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:36:13,079 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-09 05:36:13,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:36:13,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-09 05:36:13,080 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:36:13,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-09 05:36:13,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-09 05:36:13,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:36:13,081 INFO L87 Difference]: Start difference. First operand 292 states and 443 transitions. Second operand 7 states. [2019-09-09 05:36:13,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:36:13,819 INFO L93 Difference]: Finished difference Result 583 states and 858 transitions. [2019-09-09 05:36:13,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-09 05:36:13,824 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2019-09-09 05:36:13,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:36:13,827 INFO L225 Difference]: With dead ends: 583 [2019-09-09 05:36:13,828 INFO L226 Difference]: Without dead ends: 581 [2019-09-09 05:36:13,829 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-09-09 05:36:13,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2019-09-09 05:36:13,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 460. [2019-09-09 05:36:13,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-09-09 05:36:13,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 689 transitions. [2019-09-09 05:36:13,845 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 689 transitions. Word has length 74 [2019-09-09 05:36:13,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:36:13,845 INFO L475 AbstractCegarLoop]: Abstraction has 460 states and 689 transitions. [2019-09-09 05:36:13,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-09 05:36:13,846 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 689 transitions. [2019-09-09 05:36:13,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-09 05:36:13,847 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:36:13,847 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:36:13,848 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:36:13,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:36:13,848 INFO L82 PathProgramCache]: Analyzing trace with hash 929022849, now seen corresponding path program 1 times [2019-09-09 05:36:13,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:36:13,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:36:13,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:36:13,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:36:13,850 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:36:13,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:36:14,002 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-09 05:36:14,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:36:14,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-09 05:36:14,003 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:36:14,003 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-09 05:36:14,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-09 05:36:14,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-09 05:36:14,004 INFO L87 Difference]: Start difference. First operand 460 states and 689 transitions. Second operand 9 states. [2019-09-09 05:36:14,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:36:14,943 INFO L93 Difference]: Finished difference Result 683 states and 987 transitions. [2019-09-09 05:36:14,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-09 05:36:14,944 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2019-09-09 05:36:14,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:36:14,948 INFO L225 Difference]: With dead ends: 683 [2019-09-09 05:36:14,948 INFO L226 Difference]: Without dead ends: 680 [2019-09-09 05:36:14,948 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-09-09 05:36:14,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2019-09-09 05:36:14,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 565. [2019-09-09 05:36:14,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 565 states. [2019-09-09 05:36:14,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 843 transitions. [2019-09-09 05:36:14,966 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 843 transitions. Word has length 75 [2019-09-09 05:36:14,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:36:14,966 INFO L475 AbstractCegarLoop]: Abstraction has 565 states and 843 transitions. [2019-09-09 05:36:14,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-09 05:36:14,966 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 843 transitions. [2019-09-09 05:36:14,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-09 05:36:14,968 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:36:14,968 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:36:14,969 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:36:14,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:36:14,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1417842061, now seen corresponding path program 1 times [2019-09-09 05:36:14,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:36:14,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:36:14,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:36:14,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:36:14,971 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:36:15,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-09 05:36:15,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-09 05:36:15,077 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-09-09 05:36:15,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.09 05:36:15 BoogieIcfgContainer [2019-09-09 05:36:15,167 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-09 05:36:15,170 INFO L168 Benchmark]: Toolchain (without parser) took 6893.53 ms. Allocated memory was 137.4 MB in the beginning and 289.4 MB in the end (delta: 152.0 MB). Free memory was 93.8 MB in the beginning and 180.5 MB in the end (delta: -86.7 MB). Peak memory consumption was 65.3 MB. Max. memory is 7.1 GB. [2019-09-09 05:36:15,171 INFO L168 Benchmark]: CDTParser took 1.33 ms. Allocated memory is still 137.4 MB. Free memory was 111.9 MB in the beginning and 111.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-09 05:36:15,172 INFO L168 Benchmark]: CACSL2BoogieTranslator took 581.66 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 93.6 MB in the beginning and 178.1 MB in the end (delta: -84.6 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. [2019-09-09 05:36:15,173 INFO L168 Benchmark]: Boogie Preprocessor took 50.94 ms. Allocated memory is still 201.9 MB. Free memory was 178.1 MB in the beginning and 176.5 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-09-09 05:36:15,174 INFO L168 Benchmark]: RCFGBuilder took 511.79 ms. Allocated memory is still 201.9 MB. Free memory was 176.5 MB in the beginning and 155.1 MB in the end (delta: 21.4 MB). Peak memory consumption was 21.4 MB. Max. memory is 7.1 GB. [2019-09-09 05:36:15,175 INFO L168 Benchmark]: TraceAbstraction took 5740.36 ms. Allocated memory was 201.9 MB in the beginning and 289.4 MB in the end (delta: 87.6 MB). Free memory was 155.1 MB in the beginning and 180.5 MB in the end (delta: -25.4 MB). Peak memory consumption was 62.2 MB. Max. memory is 7.1 GB. [2019-09-09 05:36:15,179 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.33 ms. Allocated memory is still 137.4 MB. Free memory was 111.9 MB in the beginning and 111.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 581.66 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 93.6 MB in the beginning and 178.1 MB in the end (delta: -84.6 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 50.94 ms. Allocated memory is still 201.9 MB. Free memory was 178.1 MB in the beginning and 176.5 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 511.79 ms. Allocated memory is still 201.9 MB. Free memory was 176.5 MB in the beginning and 155.1 MB in the end (delta: 21.4 MB). Peak memory consumption was 21.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5740.36 ms. Allocated memory was 201.9 MB in the beginning and 289.4 MB in the end (delta: 87.6 MB). Free memory was 155.1 MB in the beginning and 180.5 MB in the end (delta: -25.4 MB). Peak memory consumption was 62.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 6]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseOr at line 97. Possible FailurePath: [L105] unsigned int a, b, r; [L107] b = __VERIFIER_nondet_uint() [L109] a = 234770789 VAL [a=234770789, b=0] [L111] CALL, EXPR mp_add(a, b) VAL [\old(a)=234770789, \old(b)=0] [L23] unsigned char a0, a1, a2, a3; [L24] unsigned char b0, b1, b2, b3; [L25] unsigned char r0, r1, r2, r3; [L26] unsigned short carry; [L27] unsigned short partial_sum; [L28] unsigned int r; [L29] unsigned char i; [L30] unsigned char na, nb; [L31] a0 = a [L32] a1 = a >> 8 [L33] a2 = a >> 16U [L34] a3 = a >> 24U [L35] b0 = b [L36] b1 = b >> 8U [L37] b2 = b >> 16U [L38] b3 = b >> 24U [L39] na = (unsigned char)4 VAL [\old(a)=234770789, \old(b)=0, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=0, b0=0, b1=0, b2=0, b3=0, na=4] [L40] COND FALSE !(a3 == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=0, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=0, b0=0, b1=0, b2=0, b3=0, na=4] [L49] nb = (unsigned char)4 VAL [\old(a)=234770789, \old(b)=0, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=0, b0=0, b1=0, b2=0, b3=0, na=4, nb=4] [L50] COND TRUE b3 == (unsigned char)0 [L51] nb = nb - 1 VAL [\old(a)=234770789, \old(b)=0, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=0, b0=0, b1=0, b2=0, b3=0, na=4, nb=3] [L52] COND TRUE b2 == (unsigned char)0 [L53] nb = nb - 1 VAL [\old(a)=234770789, \old(b)=0, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=0, b0=0, b1=0, b2=0, b3=0, na=4, nb=2] [L54] COND TRUE b1 == (unsigned char)0 [L55] nb = nb - 1 VAL [\old(a)=234770789, \old(b)=0, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=0, b0=0, b1=0, b2=0, b3=0, na=4, nb=1] [L59] carry = (unsigned short)0 [L60] i = (unsigned char)0 VAL [\old(a)=234770789, \old(b)=0, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1] [L61] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L62] partial_sum = carry [L63] carry = (unsigned short)0 VAL [\old(a)=234770789, \old(b)=0, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=0] [L64] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=0, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=0] [L65] COND TRUE i == (unsigned char)0 [L65] partial_sum = partial_sum + a0 VAL [\old(a)=234770789, \old(b)=0, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=101] [L66] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=0, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=101] [L67] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=0, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=101] [L68] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=0, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=101] [L70] COND TRUE i < nb VAL [\old(a)=234770789, \old(b)=0, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=101] [L71] COND TRUE i == (unsigned char)0 [L71] partial_sum = partial_sum + b0 VAL [\old(a)=234770789, \old(b)=0, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=101] [L72] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=0, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=101] [L73] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=0, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=101] [L74] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=0, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=101] [L76] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=234770789, \old(b)=0, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=101] [L80] COND TRUE i == (unsigned char)0 [L80] r0 = (unsigned char)partial_sum VAL [\old(a)=234770789, \old(b)=0, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=101, r0=101] [L81] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=0, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=101, r0=101] [L82] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=0, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=101, r0=101] [L83] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=0, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=101, r0=101] [L85] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=0, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=101, r0=101] [L61] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L62] partial_sum = carry [L63] carry = (unsigned short)0 VAL [\old(a)=234770789, \old(b)=0, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=0, r0=101] [L64] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=0, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=0, r0=101] [L65] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=0, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=0, r0=101] [L66] COND TRUE i == (unsigned char)1 [L66] partial_sum = partial_sum + a1 VAL [\old(a)=234770789, \old(b)=0, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=81, r0=101] [L67] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=0, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=81, r0=101] [L68] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=0, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=81, r0=101] [L70] COND FALSE !(i < nb) VAL [\old(a)=234770789, \old(b)=0, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=81, r0=101] [L76] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=234770789, \old(b)=0, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=81, r0=101] [L80] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=0, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=81, r0=101] [L81] COND TRUE i == (unsigned char)1 [L81] r1 = (unsigned char)partial_sum VAL [\old(a)=234770789, \old(b)=0, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=81, r0=101, r1=81] [L82] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=0, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=81, r0=101, r1=81] [L83] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=0, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=81, r0=101, r1=81] [L85] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=0, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=81, r0=101, r1=81] [L61] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L62] partial_sum = carry [L63] carry = (unsigned short)0 VAL [\old(a)=234770789, \old(b)=0, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=0, r0=101, r1=81] [L64] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=0, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=0, r0=101, r1=81] [L65] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=0, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=0, r0=101, r1=81] [L66] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=0, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=0, r0=101, r1=81] [L67] COND TRUE i == (unsigned char)2 [L67] partial_sum = partial_sum + a2 VAL [\old(a)=234770789, \old(b)=0, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=101, r1=81] [L68] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=0, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=101, r1=81] [L70] COND FALSE !(i < nb) VAL [\old(a)=234770789, \old(b)=0, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=101, r1=81] [L76] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=234770789, \old(b)=0, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=101, r1=81] [L80] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=0, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=101, r1=81] [L81] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=0, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=101, r1=81] [L82] COND TRUE i == (unsigned char)2 [L82] r2 = (unsigned char)partial_sum VAL [\old(a)=234770789, \old(b)=0, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=101, r1=81, r2=254] [L83] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=0, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=101, r1=81, r2=254] [L85] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=0, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=254, r0=101, r1=81, r2=254] [L61] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L62] partial_sum = carry [L63] carry = (unsigned short)0 VAL [\old(a)=234770789, \old(b)=0, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=0, r0=101, r1=81, r2=254] [L64] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=0, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=0, r0=101, r1=81, r2=254] [L65] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=0, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=0, r0=101, r1=81, r2=254] [L66] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=0, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=0, r0=101, r1=81, r2=254] [L67] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=0, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=0, r0=101, r1=81, r2=254] [L68] COND TRUE i == (unsigned char)3 [L68] partial_sum = partial_sum + a3 VAL [\old(a)=234770789, \old(b)=0, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=101, r1=81, r2=254] [L70] COND FALSE !(i < nb) VAL [\old(a)=234770789, \old(b)=0, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=101, r1=81, r2=254] [L76] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=234770789, \old(b)=0, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=101, r1=81, r2=254] [L80] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=0, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=101, r1=81, r2=254] [L81] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=0, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=101, r1=81, r2=254] [L82] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=0, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=101, r1=81, r2=254] [L83] COND TRUE i == (unsigned char)3 [L83] r3 = (unsigned char)partial_sum VAL [\old(a)=234770789, \old(b)=0, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=101, r1=81, r2=254, r3=13] [L85] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=0, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=4, na=4, nb=1, partial_sum=13, r0=101, r1=81, r2=254, r3=13] [L61] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [\old(a)=234770789, \old(b)=0, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=4, na=4, nb=1, partial_sum=13, r0=101, r1=81, r2=254, r3=13] [L88] COND FALSE !(i < (unsigned char)4) VAL [\old(a)=234770789, \old(b)=0, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=4, na=4, nb=1, partial_sum=13, r0=101, r1=81, r2=254, r3=13] [L97] r = r0 | (r1 << 8U) | (r2 << 16U) | ((unsigned int)r3 << 24U) [L99] return r; VAL [\old(a)=234770789, \old(b)=0, \result=0, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=4, na=4, nb=1, partial_sum=13, r=0, r0=101, r1=81, r2=254, r3=13] [L111] RET, EXPR mp_add(a, b) VAL [a=234770789, b=0, mp_add(a, b)=0] [L111] r = mp_add(a, b) [L113] CALL __VERIFIER_assert(r == a + b) VAL [\old(cond)=0] [L5] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L6] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 54 locations, 1 error locations. UNSAFE Result, 5.6s OverallTime, 12 OverallIterations, 4 TraceHistogramMax, 3.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 684 SDtfs, 1267 SDslu, 1110 SDs, 0 SdLazy, 1694 SolverSat, 258 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 25 SyntacticMatches, 7 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=565occurred 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, 11 MinimizatonAttempts, 871 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 550 NumberOfCodeBlocks, 550 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 460 ConstructedInterpolants, 0 QuantifiedInterpolants, 76918 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 304/304 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...